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/fragtest_simple.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:34:00,324 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:34:00,326 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:34:00,338 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:34:00,339 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:34:00,340 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:34:00,341 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:34:00,343 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:34:00,345 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:34:00,345 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:34:00,346 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:34:00,347 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:34:00,348 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:34:00,349 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:34:00,350 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:34:00,350 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:34:00,351 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:34:00,353 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:34:00,355 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:34:00,356 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:34:00,358 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:34:00,359 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:34:00,361 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:34:00,361 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:34:00,361 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:34:00,362 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:34:00,363 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:34:00,364 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:34:00,365 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:34:00,366 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:34:00,366 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:34:00,367 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:34:00,367 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:34:00,368 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:34:00,369 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:34:00,369 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:34:00,370 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:34:00,382 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:34:00,383 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:34:00,383 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:34:00,384 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:34:00,384 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:34:00,384 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:34:00,384 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:34:00,384 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:34:00,385 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:34:00,385 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:34:00,385 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:34:00,385 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:34:00,385 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:34:00,386 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:34:00,386 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:34:00,386 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:34:00,387 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:34:00,387 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:34:00,387 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:34:00,387 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:34:00,387 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:34:00,388 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:34:00,388 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:34:00,388 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:34:00,388 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:34:00,388 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:34:00,389 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:34:00,389 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:34:00,389 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:34:00,389 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:34:00,389 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:34:00,390 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:34:00,390 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:34:00,390 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:34:00,390 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:34:00,390 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:34:00,391 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:34:00,391 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:34:00,391 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:34:00,391 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:34:00,391 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:34:00,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:34:00,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:34:00,442 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:34:00,444 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:34:00,444 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:34:00,445 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/fragtest_simple.i_4.bpl [2018-12-03 15:34:00,446 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/fragtest_simple.i_4.bpl' [2018-12-03 15:34:00,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:34:00,501 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:34:00,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:34:00,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:34:00,502 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:34:00,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:34:00" (1/1) ... [2018-12-03 15:34:00,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:34:00" (1/1) ... [2018-12-03 15:34:00,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:34:00,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:34:00,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:34:00,541 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:34:00,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:34:00" (1/1) ... [2018-12-03 15:34:00,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:34:00" (1/1) ... [2018-12-03 15:34:00,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:34:00" (1/1) ... [2018-12-03 15:34:00,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:34:00" (1/1) ... [2018-12-03 15:34:00,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:34:00" (1/1) ... [2018-12-03 15:34:00,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:34:00" (1/1) ... [2018-12-03 15:34:00,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:34:00" (1/1) ... [2018-12-03 15:34:00,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:34:00,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:34:00,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:34:00,567 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:34:00,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:34:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:34:00,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:34:00,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:34:00,949 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:34:00,949 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-03 15:34:00,950 INFO L202 PluginConnector]: Adding new model fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:34:00 BoogieIcfgContainer [2018-12-03 15:34:00,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:34:00,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:34:00,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:34:00,956 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:34:00,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:34:00" (1/2) ... [2018-12-03 15:34:00,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57bc6f1 and model type fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:34:00, skipping insertion in model container [2018-12-03 15:34:00,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:34:00" (2/2) ... [2018-12-03 15:34:00,960 INFO L112 eAbstractionObserver]: Analyzing ICFG fragtest_simple.i_4.bpl [2018-12-03 15:34:00,973 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:34:00,984 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:34:01,005 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:34:01,046 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:34:01,046 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:34:01,046 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:34:01,047 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:34:01,047 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:34:01,047 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:34:01,047 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:34:01,047 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:34:01,063 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-12-03 15:34:01,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:34:01,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:01,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 15:34:01,074 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:01,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:01,080 INFO L82 PathProgramCache]: Analyzing trace with hash 889599113, now seen corresponding path program 1 times [2018-12-03 15:34:01,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:01,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:01,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:01,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:01,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:01,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:01,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:34:01,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:34:01,342 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:34:01,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:34:01,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:34:01,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:34:01,381 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2018-12-03 15:34:01,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:01,522 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-12-03 15:34:01,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:34:01,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-03 15:34:01,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:01,536 INFO L225 Difference]: With dead ends: 14 [2018-12-03 15:34:01,536 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:34:01,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:34:01,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:34:01,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-12-03 15:34:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:34:01,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-03 15:34:01,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-12-03 15:34:01,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:01,574 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-03 15:34:01,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:34:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-03 15:34:01,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:34:01,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:01,576 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-03 15:34:01,576 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:01,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:01,578 INFO L82 PathProgramCache]: Analyzing trace with hash 206308035, now seen corresponding path program 1 times [2018-12-03 15:34:01,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:01,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:01,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:01,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:01,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:01,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:34:01,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:34:01,774 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:34:01,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:34:01,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:34:01,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:34:01,778 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2018-12-03 15:34:01,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:01,926 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-12-03 15:34:01,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:34:01,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-03 15:34:01,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:01,927 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:34:01,927 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 15:34:01,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:34:01,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 15:34:01,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 15:34:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:34:01,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-12-03 15:34:01,932 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-12-03 15:34:01,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:01,933 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-03 15:34:01,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:34:01,933 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-12-03 15:34:01,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:34:01,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:01,934 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 15:34:01,934 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:01,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:01,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1531170369, now seen corresponding path program 1 times [2018-12-03 15:34:01,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:01,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:01,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:01,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:01,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:02,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:02,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:02,091 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:02,092 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-03 15:34:02,093 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18] [2018-12-03 15:34:02,142 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:34:02,142 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:34:02,552 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:34:02,554 INFO L272 AbstractInterpreter]: Visited 8 different actions 38 times. Merged at 7 different actions 27 times. Widened at 4 different actions 4 times. Found 3 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:34:02,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:02,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:34:02,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:02,563 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:02,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:02,575 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:02,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:02,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:02,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:03,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:03,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2018-12-03 15:34:03,073 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:03,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:34:03,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:34:03,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:34:03,075 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 9 states. [2018-12-03 15:34:03,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:03,580 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-12-03 15:34:03,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:34:03,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-12-03 15:34:03,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:03,583 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:34:03,583 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 15:34:03,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:34:03,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 15:34:03,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 15:34:03,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:34:03,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-03 15:34:03,590 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-12-03 15:34:03,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:03,590 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-03 15:34:03,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:34:03,591 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-03 15:34:03,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:34:03,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:03,591 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-12-03 15:34:03,592 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:03,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:03,592 INFO L82 PathProgramCache]: Analyzing trace with hash -587211915, now seen corresponding path program 2 times [2018-12-03 15:34:03,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:03,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:03,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:03,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:03,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:03,808 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:03,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:03,809 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:03,809 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:03,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:03,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:03,809 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:03,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:03,819 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:03,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 15:34:03,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:03,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:04,228 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:04,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:04,418 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:04,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:04,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2018-12-03 15:34:04,440 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:04,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:34:04,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:34:04,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:34:04,442 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 12 states. [2018-12-03 15:34:04,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:04,817 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-12-03 15:34:04,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:34:04,819 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-12-03 15:34:04,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:04,820 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:34:04,820 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:34:04,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:34:04,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:34:04,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 15:34:04,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:34:04,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-03 15:34:04,827 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-12-03 15:34:04,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:04,827 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-03 15:34:04,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:34:04,827 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-03 15:34:04,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:34:04,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:04,828 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-12-03 15:34:04,828 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:04,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:04,829 INFO L82 PathProgramCache]: Analyzing trace with hash 70717867, now seen corresponding path program 3 times [2018-12-03 15:34:04,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:04,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:04,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:04,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:04,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:05,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:05,124 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:05,124 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:05,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:05,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:05,125 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:05,134 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:05,134 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:05,153 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:05,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:05,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:05,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:05,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:05,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2018-12-03 15:34:05,324 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:05,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:34:05,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:34:05,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:34:05,326 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 12 states. [2018-12-03 15:34:05,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:05,408 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-12-03 15:34:05,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:34:05,409 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-12-03 15:34:05,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:05,410 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:34:05,410 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:34:05,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:34:05,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:34:05,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 15:34:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 15:34:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-03 15:34:05,416 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-12-03 15:34:05,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:05,416 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-03 15:34:05,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:34:05,416 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-03 15:34:05,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:34:05,417 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:05,417 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1] [2018-12-03 15:34:05,418 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:05,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:05,418 INFO L82 PathProgramCache]: Analyzing trace with hash 2045097383, now seen corresponding path program 4 times [2018-12-03 15:34:05,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:05,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:05,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:05,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:05,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:05,544 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:05,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:05,545 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:05,545 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:05,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:05,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:05,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:05,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:05,558 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:05,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:05,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:05,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:05,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2018-12-03 15:34:05,710 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:05,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:34:05,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:34:05,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:34:05,711 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2018-12-03 15:34:05,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:05,846 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-12-03 15:34:05,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:34:05,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-12-03 15:34:05,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:05,848 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:34:05,849 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:34:05,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:34:05,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:34:05,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-12-03 15:34:05,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 15:34:05,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-03 15:34:05,856 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 20 [2018-12-03 15:34:05,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:05,856 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-03 15:34:05,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:34:05,857 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-03 15:34:05,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:34:05,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:05,858 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1] [2018-12-03 15:34:05,858 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:05,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:05,858 INFO L82 PathProgramCache]: Analyzing trace with hash 37022875, now seen corresponding path program 5 times [2018-12-03 15:34:05,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:05,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:05,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:05,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:05,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:06,054 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:06,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:06,055 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:06,055 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:06,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:06,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:06,056 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:06,065 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:06,065 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:06,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 15:34:06,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:06,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:06,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:06,338 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:06,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:06,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2018-12-03 15:34:06,358 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:06,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:34:06,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:34:06,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:34:06,360 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 17 states. [2018-12-03 15:34:06,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:06,483 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-12-03 15:34:06,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:34:06,485 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-12-03 15:34:06,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:06,486 INFO L225 Difference]: With dead ends: 41 [2018-12-03 15:34:06,486 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:34:06,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:34:06,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:34:06,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 15:34:06,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 15:34:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-03 15:34:06,494 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-12-03 15:34:06,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:06,494 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-03 15:34:06,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:34:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-03 15:34:06,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:34:06,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:06,496 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-12-03 15:34:06,496 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:06,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:06,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1480612969, now seen corresponding path program 6 times [2018-12-03 15:34:06,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:06,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:06,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:06,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:06,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:06,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:06,693 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:06,693 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:06,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:06,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:06,694 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:06,704 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:06,704 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:06,730 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:06,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:06,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:07,079 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:07,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:07,209 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:07,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:07,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2018-12-03 15:34:07,229 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:07,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:34:07,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:34:07,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:34:07,230 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 18 states. [2018-12-03 15:34:08,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:08,009 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-12-03 15:34:08,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:34:08,009 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2018-12-03 15:34:08,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:08,010 INFO L225 Difference]: With dead ends: 43 [2018-12-03 15:34:08,010 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:34:08,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 11 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:34:08,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:34:08,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 15:34:08,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 15:34:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-12-03 15:34:08,017 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-12-03 15:34:08,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:08,018 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-12-03 15:34:08,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:34:08,018 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-03 15:34:08,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:34:08,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:08,019 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1] [2018-12-03 15:34:08,020 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:08,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:08,020 INFO L82 PathProgramCache]: Analyzing trace with hash 360221587, now seen corresponding path program 7 times [2018-12-03 15:34:08,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:08,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:08,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:08,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:08,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:08,525 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:08,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:08,526 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:08,526 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:08,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:08,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:08,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:08,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:08,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:08,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:08,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:08,969 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:08,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:08,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2018-12-03 15:34:08,990 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:08,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:34:08,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:34:08,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:34:08,991 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 12 states. [2018-12-03 15:34:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:09,165 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-12-03 15:34:09,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:34:09,167 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-12-03 15:34:09,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:09,168 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:34:09,168 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:34:09,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:34:09,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:34:09,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-12-03 15:34:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 15:34:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-03 15:34:09,175 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2018-12-03 15:34:09,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:09,176 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-03 15:34:09,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:34:09,176 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-03 15:34:09,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 15:34:09,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:09,177 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 1, 1, 1, 1] [2018-12-03 15:34:09,177 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:09,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:09,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1263725703, now seen corresponding path program 8 times [2018-12-03 15:34:09,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:09,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:09,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:09,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:09,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 56 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:09,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:09,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:09,441 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:09,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:09,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:09,442 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:09,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:09,456 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:09,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 15:34:09,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:09,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 56 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:09,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:09,901 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 56 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:09,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:09,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 24 [2018-12-03 15:34:09,921 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:09,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:34:09,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:34:09,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:34:09,923 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 23 states. [2018-12-03 15:34:10,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:10,103 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-12-03 15:34:10,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:34:10,104 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2018-12-03 15:34:10,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:10,105 INFO L225 Difference]: With dead ends: 53 [2018-12-03 15:34:10,105 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:34:10,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 12 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:34:10,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:34:10,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 15:34:10,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 15:34:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-03 15:34:10,112 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-12-03 15:34:10,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:10,112 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-03 15:34:10,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:34:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-03 15:34:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 15:34:10,113 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:10,113 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2018-12-03 15:34:10,114 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:10,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:10,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1629808515, now seen corresponding path program 9 times [2018-12-03 15:34:10,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:10,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:10,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:10,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:10,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:10,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:10,449 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:10,449 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:10,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:10,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:10,449 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:10,458 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:10,458 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:10,496 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:10,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:10,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:10,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:10,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:10,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 23 [2018-12-03 15:34:10,816 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:10,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:34:10,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:34:10,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:34:10,818 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 24 states. [2018-12-03 15:34:11,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:11,052 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-12-03 15:34:11,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:34:11,052 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2018-12-03 15:34:11,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:11,054 INFO L225 Difference]: With dead ends: 55 [2018-12-03 15:34:11,054 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:34:11,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 15 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=262, Invalid=668, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:34:11,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:34:11,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 15:34:11,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 15:34:11,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-03 15:34:11,060 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-12-03 15:34:11,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:11,061 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-03 15:34:11,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:34:11,061 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-03 15:34:11,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 15:34:11,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:11,062 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 1, 1, 1, 1] [2018-12-03 15:34:11,062 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:11,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:11,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1248072575, now seen corresponding path program 10 times [2018-12-03 15:34:11,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:11,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:11,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:11,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:11,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:11,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:11,214 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:11,215 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:11,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:11,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:11,215 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:11,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:11,224 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:11,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:11,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:11,386 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:11,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:11,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 14 [2018-12-03 15:34:11,408 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:11,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:34:11,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:34:11,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:34:11,409 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 14 states. [2018-12-03 15:34:11,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:11,728 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-12-03 15:34:11,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:34:11,729 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2018-12-03 15:34:11,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:11,730 INFO L225 Difference]: With dead ends: 44 [2018-12-03 15:34:11,730 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 15:34:11,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 62 SyntacticMatches, 14 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=342, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:34:11,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 15:34:11,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-12-03 15:34:11,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 15:34:11,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-03 15:34:11,738 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 36 [2018-12-03 15:34:11,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:11,738 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-03 15:34:11,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:34:11,738 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-03 15:34:11,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 15:34:11,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:11,739 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1] [2018-12-03 15:34:11,740 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:11,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:11,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1910464909, now seen corresponding path program 11 times [2018-12-03 15:34:11,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:11,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:11,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:11,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:11,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:12,152 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 90 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:12,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:12,153 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:12,153 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:12,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:12,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:12,153 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:12,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:12,161 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:12,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 15:34:12,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:12,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:12,436 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 90 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:12,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:12,626 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 90 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:12,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:12,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 30 [2018-12-03 15:34:12,647 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:12,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 15:34:12,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 15:34:12,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=691, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:34:12,648 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 29 states. [2018-12-03 15:34:12,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:12,904 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-12-03 15:34:12,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:34:12,905 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 40 [2018-12-03 15:34:12,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:12,906 INFO L225 Difference]: With dead ends: 65 [2018-12-03 15:34:12,906 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 15:34:12,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 52 SyntacticMatches, 16 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=407, Invalid=1075, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:34:12,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 15:34:12,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 15:34:12,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 15:34:12,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-03 15:34:12,913 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-12-03 15:34:12,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:12,913 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-03 15:34:12,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 15:34:12,913 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-03 15:34:12,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 15:34:12,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:12,914 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2018-12-03 15:34:12,914 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:12,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:12,915 INFO L82 PathProgramCache]: Analyzing trace with hash 179690863, now seen corresponding path program 12 times [2018-12-03 15:34:12,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:12,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:12,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:12,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:12,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:13,191 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:13,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:13,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:13,192 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:13,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:13,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:13,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:13,202 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:13,202 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:13,236 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:13,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:13,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:13,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:13,727 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:13,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:13,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 29 [2018-12-03 15:34:13,746 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:13,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:34:13,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:34:13,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:34:13,748 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 30 states. [2018-12-03 15:34:14,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:14,210 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-12-03 15:34:14,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:34:14,211 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 42 [2018-12-03 15:34:14,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:14,211 INFO L225 Difference]: With dead ends: 67 [2018-12-03 15:34:14,211 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 15:34:14,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 55 SyntacticMatches, 19 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=408, Invalid=1074, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:34:14,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 15:34:14,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 15:34:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 15:34:14,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-03 15:34:14,219 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-12-03 15:34:14,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:14,219 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-03 15:34:14,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:34:14,220 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-03 15:34:14,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 15:34:14,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:14,220 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1] [2018-12-03 15:34:14,221 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:14,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:14,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1225306773, now seen corresponding path program 13 times [2018-12-03 15:34:14,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:14,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:14,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:14,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:14,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 110 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:14,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:14,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:14,453 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:14,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:14,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:14,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:14,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:14,462 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:14,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 110 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:14,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:14,735 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 110 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:14,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:14,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 16 [2018-12-03 15:34:14,755 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:14,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:34:14,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:34:14,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:34:14,756 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 16 states. [2018-12-03 15:34:14,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:14,992 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-12-03 15:34:14,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:34:14,993 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-12-03 15:34:14,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:14,994 INFO L225 Difference]: With dead ends: 52 [2018-12-03 15:34:14,994 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 15:34:14,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 76 SyntacticMatches, 18 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=287, Invalid=469, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:34:14,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 15:34:15,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-12-03 15:34:15,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 15:34:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-12-03 15:34:15,004 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2018-12-03 15:34:15,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:15,004 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-12-03 15:34:15,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:34:15,004 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-12-03 15:34:15,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 15:34:15,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:15,005 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 1, 1, 1, 1] [2018-12-03 15:34:15,005 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:15,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:15,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1452473761, now seen corresponding path program 14 times [2018-12-03 15:34:15,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:15,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:15,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:15,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:15,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:15,594 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 132 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:15,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:15,594 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:15,594 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:15,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:15,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:15,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:15,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:15,604 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:15,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 15:34:15,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:15,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:15,913 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 132 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:15,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:16,450 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 132 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:16,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:16,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 36 [2018-12-03 15:34:16,470 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:16,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 15:34:16,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 15:34:16,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=997, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:34:16,471 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 35 states. [2018-12-03 15:34:16,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:16,849 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-12-03 15:34:16,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:34:16,850 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 48 [2018-12-03 15:34:16,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:16,851 INFO L225 Difference]: With dead ends: 77 [2018-12-03 15:34:16,851 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 15:34:16,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 62 SyntacticMatches, 20 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=585, Invalid=1577, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:34:16,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 15:34:16,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 15:34:16,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 15:34:16,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-03 15:34:16,860 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-12-03 15:34:16,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:16,860 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-03 15:34:16,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 15:34:16,861 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-03 15:34:16,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 15:34:16,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:16,862 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2018-12-03 15:34:16,862 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:16,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:16,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1195476315, now seen corresponding path program 15 times [2018-12-03 15:34:16,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:16,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:16,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:16,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:16,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:17,767 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 132 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:17,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:17,768 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:17,768 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:17,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:17,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:17,768 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:17,778 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:17,778 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:17,815 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:17,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:17,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:18,340 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 132 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:18,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 132 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:18,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:18,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 35 [2018-12-03 15:34:18,531 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:18,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:34:18,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:34:18,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:34:18,533 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 36 states. [2018-12-03 15:34:18,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:18,770 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-12-03 15:34:18,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:34:18,771 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 50 [2018-12-03 15:34:18,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:18,772 INFO L225 Difference]: With dead ends: 79 [2018-12-03 15:34:18,772 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 15:34:18,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 65 SyntacticMatches, 23 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=586, Invalid=1576, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:34:18,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 15:34:18,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 15:34:18,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 15:34:18,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-03 15:34:18,783 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2018-12-03 15:34:18,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:18,783 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-03 15:34:18,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:34:18,784 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-03 15:34:18,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 15:34:18,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:18,785 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 1, 1, 1, 1] [2018-12-03 15:34:18,785 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:18,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:18,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1040107177, now seen corresponding path program 16 times [2018-12-03 15:34:18,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:18,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:18,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:18,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:18,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:19,052 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 156 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:19,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:19,053 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:19,053 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:19,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:19,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:19,053 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:19,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:19,062 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:19,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:19,142 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 156 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:19,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:19,337 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 156 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:19,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:19,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 18 [2018-12-03 15:34:19,356 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:19,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:34:19,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:34:19,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:34:19,357 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 18 states. [2018-12-03 15:34:19,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:19,580 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-12-03 15:34:19,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:34:19,580 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-12-03 15:34:19,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:19,581 INFO L225 Difference]: With dead ends: 60 [2018-12-03 15:34:19,582 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 15:34:19,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 90 SyntacticMatches, 22 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=616, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:34:19,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 15:34:19,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-12-03 15:34:19,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 15:34:19,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-03 15:34:19,591 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2018-12-03 15:34:19,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:19,591 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-03 15:34:19,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:34:19,591 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-03 15:34:19,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 15:34:19,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:19,592 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 1, 1, 1, 1] [2018-12-03 15:34:19,592 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:19,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:19,592 INFO L82 PathProgramCache]: Analyzing trace with hash 75962443, now seen corresponding path program 17 times [2018-12-03 15:34:19,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:19,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:19,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:19,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:19,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:19,922 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 182 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:19,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:19,923 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:19,923 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:19,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:19,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:19,923 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:19,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:19,933 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:20,043 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 15:34:20,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:20,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:20,417 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 182 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:20,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 182 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:20,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:20,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 42 [2018-12-03 15:34:20,690 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:20,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 15:34:20,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 15:34:20,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=1359, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 15:34:20,692 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 41 states. [2018-12-03 15:34:21,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:21,080 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2018-12-03 15:34:21,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:34:21,081 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 56 [2018-12-03 15:34:21,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:21,081 INFO L225 Difference]: With dead ends: 89 [2018-12-03 15:34:21,081 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 15:34:21,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 72 SyntacticMatches, 24 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=795, Invalid=2175, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:34:21,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 15:34:21,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 15:34:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 15:34:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-12-03 15:34:21,090 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2018-12-03 15:34:21,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:21,091 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-12-03 15:34:21,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 15:34:21,091 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-12-03 15:34:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 15:34:21,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:21,092 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1] [2018-12-03 15:34:21,092 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:21,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:21,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1108795207, now seen corresponding path program 18 times [2018-12-03 15:34:21,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:21,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:21,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:21,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:21,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:21,729 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 182 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:21,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:21,729 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:21,729 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:21,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:21,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:21,730 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:21,740 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:21,740 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:21,792 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:21,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:21,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 182 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:22,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 182 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:24,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:24,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 41 [2018-12-03 15:34:24,022 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:24,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 15:34:24,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 15:34:24,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1303, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:34:24,023 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 42 states. [2018-12-03 15:34:24,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:24,333 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-12-03 15:34:24,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:34:24,333 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 58 [2018-12-03 15:34:24,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:24,333 INFO L225 Difference]: With dead ends: 91 [2018-12-03 15:34:24,333 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 15:34:24,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 75 SyntacticMatches, 27 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=796, Invalid=2174, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:34:24,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 15:34:24,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 15:34:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 15:34:24,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-12-03 15:34:24,342 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2018-12-03 15:34:24,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:24,343 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-12-03 15:34:24,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 15:34:24,343 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-12-03 15:34:24,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 15:34:24,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:24,344 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 1, 1, 1, 1] [2018-12-03 15:34:24,344 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:24,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:24,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1523636035, now seen corresponding path program 19 times [2018-12-03 15:34:24,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:24,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:24,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:24,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:24,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:25,276 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 210 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:25,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:25,277 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:25,277 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:25,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:25,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:25,277 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:25,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:25,286 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:25,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 210 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:25,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 210 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:25,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:25,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 20 [2018-12-03 15:34:25,560 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:25,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:34:25,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:34:25,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:34:25,561 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 20 states. [2018-12-03 15:34:25,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:25,884 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-12-03 15:34:25,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:34:25,884 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-12-03 15:34:25,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:25,885 INFO L225 Difference]: With dead ends: 68 [2018-12-03 15:34:25,885 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 15:34:25,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 104 SyntacticMatches, 26 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=477, Invalid=783, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:34:25,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 15:34:25,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-12-03 15:34:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 15:34:25,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-12-03 15:34:25,893 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 60 [2018-12-03 15:34:25,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:25,894 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-12-03 15:34:25,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:34:25,894 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-12-03 15:34:25,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 15:34:25,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:25,895 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 14, 1, 1, 1, 1] [2018-12-03 15:34:25,895 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:25,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:25,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1329455159, now seen corresponding path program 20 times [2018-12-03 15:34:25,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:25,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:25,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:25,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:25,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 240 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:26,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:26,352 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:26,353 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:26,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:26,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:26,353 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:26,362 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:26,363 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:26,423 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 15:34:26,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:26,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:26,836 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 240 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:26,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:27,194 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 240 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:27,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:27,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 48 [2018-12-03 15:34:27,214 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:27,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 15:34:27,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 15:34:27,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1777, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 15:34:27,215 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 47 states. [2018-12-03 15:34:27,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:27,771 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2018-12-03 15:34:27,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:34:27,774 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 64 [2018-12-03 15:34:27,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:27,775 INFO L225 Difference]: With dead ends: 101 [2018-12-03 15:34:27,775 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 15:34:27,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 82 SyntacticMatches, 28 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1334 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1037, Invalid=2869, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 15:34:27,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 15:34:27,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 15:34:27,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 15:34:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-12-03 15:34:27,783 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2018-12-03 15:34:27,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:27,783 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-12-03 15:34:27,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 15:34:27,783 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-12-03 15:34:27,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 15:34:27,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:27,784 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1] [2018-12-03 15:34:27,784 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:27,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:27,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1862593331, now seen corresponding path program 21 times [2018-12-03 15:34:27,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:27,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:27,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:27,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:27,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:28,206 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:28,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:28,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:28,207 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:28,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:28,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:28,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:28,215 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:28,215 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:28,262 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:28,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:28,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:28,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:29,152 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:29,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:29,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 47 [2018-12-03 15:34:29,172 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:29,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 15:34:29,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 15:34:29,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=1713, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:34:29,173 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 48 states. [2018-12-03 15:34:29,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:29,570 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2018-12-03 15:34:29,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:34:29,570 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 66 [2018-12-03 15:34:29,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:29,571 INFO L225 Difference]: With dead ends: 103 [2018-12-03 15:34:29,571 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 15:34:29,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 85 SyntacticMatches, 31 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1038, Invalid=2868, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 15:34:29,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 15:34:29,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 15:34:29,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 15:34:29,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-03 15:34:29,578 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2018-12-03 15:34:29,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:29,578 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-03 15:34:29,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 15:34:29,578 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-03 15:34:29,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 15:34:29,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:29,579 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 15, 1, 1, 1, 1] [2018-12-03 15:34:29,579 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:29,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:29,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1187698897, now seen corresponding path program 22 times [2018-12-03 15:34:29,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:29,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:29,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:29,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:29,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:30,659 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 272 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:30,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:30,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:30,660 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:30,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:30,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:30,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:30,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:30,670 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:30,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:30,753 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 272 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:30,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:30,946 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 272 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:30,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:30,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 22 [2018-12-03 15:34:30,966 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:30,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:34:30,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:34:30,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:34:30,967 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 22 states. [2018-12-03 15:34:31,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:31,275 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-12-03 15:34:31,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 15:34:31,275 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-12-03 15:34:31,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:31,276 INFO L225 Difference]: With dead ends: 76 [2018-12-03 15:34:31,277 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 15:34:31,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 118 SyntacticMatches, 30 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=590, Invalid=970, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:34:31,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 15:34:31,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-12-03 15:34:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 15:34:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-12-03 15:34:31,286 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 68 [2018-12-03 15:34:31,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:31,286 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-12-03 15:34:31,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:34:31,287 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-12-03 15:34:31,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 15:34:31,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:31,287 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 16, 1, 1, 1, 1] [2018-12-03 15:34:31,287 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:31,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:31,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1105222179, now seen corresponding path program 23 times [2018-12-03 15:34:31,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:31,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:31,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:31,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:31,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:31,804 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 306 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:31,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:31,804 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:31,804 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:31,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:31,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:31,805 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:31,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:31,813 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:31,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 15:34:31,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:31,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:32,630 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 306 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:32,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 306 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:33,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:33,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 54 [2018-12-03 15:34:33,105 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:33,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 15:34:33,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 15:34:33,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=719, Invalid=2251, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:34:33,107 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 53 states. [2018-12-03 15:34:33,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:33,802 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-12-03 15:34:33,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 15:34:33,803 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 72 [2018-12-03 15:34:33,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:33,803 INFO L225 Difference]: With dead ends: 113 [2018-12-03 15:34:33,804 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 15:34:33,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 92 SyntacticMatches, 32 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1311, Invalid=3659, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:34:33,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 15:34:33,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 15:34:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 15:34:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-12-03 15:34:33,814 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-12-03 15:34:33,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:33,814 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-12-03 15:34:33,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 15:34:33,814 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-12-03 15:34:33,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 15:34:33,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:33,815 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1] [2018-12-03 15:34:33,815 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:33,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:33,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1247455519, now seen corresponding path program 24 times [2018-12-03 15:34:33,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:33,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:33,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:33,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:33,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 306 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:34,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:34,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:34,364 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:34,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:34,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:34,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:34,373 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:34,374 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:34,433 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:34,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:34,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 306 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:35,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:35,543 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 306 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:35,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:35,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 53 [2018-12-03 15:34:35,562 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:35,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 15:34:35,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 15:34:35,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=2179, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:34:35,563 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 54 states. [2018-12-03 15:34:35,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:35,931 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-12-03 15:34:35,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:34:35,931 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 74 [2018-12-03 15:34:35,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:35,932 INFO L225 Difference]: With dead ends: 115 [2018-12-03 15:34:35,932 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 15:34:35,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 95 SyntacticMatches, 35 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1685 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1312, Invalid=3658, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:34:35,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 15:34:35,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 15:34:35,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 15:34:35,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-12-03 15:34:35,941 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2018-12-03 15:34:35,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:35,942 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-12-03 15:34:35,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 15:34:35,942 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-12-03 15:34:35,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 15:34:35,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:35,942 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 1, 1, 1, 1] [2018-12-03 15:34:35,943 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:35,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:35,943 INFO L82 PathProgramCache]: Analyzing trace with hash 494741787, now seen corresponding path program 25 times [2018-12-03 15:34:35,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:35,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:35,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:35,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:35,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:36,303 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 342 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:36,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:36,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:36,304 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:36,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:36,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:36,304 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:36,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:36,312 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:36,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 342 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:36,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:36,661 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 342 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:36,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:36,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 24 [2018-12-03 15:34:36,680 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:36,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:34:36,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:34:36,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:34:36,681 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 24 states. [2018-12-03 15:34:37,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:37,057 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-12-03 15:34:37,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 15:34:37,058 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 76 [2018-12-03 15:34:37,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:37,059 INFO L225 Difference]: With dead ends: 84 [2018-12-03 15:34:37,059 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 15:34:37,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 132 SyntacticMatches, 34 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=715, Invalid=1177, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:34:37,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 15:34:37,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-12-03 15:34:37,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 15:34:37,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-12-03 15:34:37,068 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 76 [2018-12-03 15:34:37,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:37,068 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-12-03 15:34:37,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:34:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-12-03 15:34:37,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 15:34:37,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:37,069 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 18, 1, 1, 1, 1] [2018-12-03 15:34:37,069 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:37,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:37,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1564313103, now seen corresponding path program 26 times [2018-12-03 15:34:37,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:37,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:37,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:37,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:37,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:38,268 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 380 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:38,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:38,268 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:38,268 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:38,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:38,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:38,269 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:38,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:38,279 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:38,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 15:34:38,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:38,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 380 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:39,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:39,516 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 380 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:39,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:39,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 60 [2018-12-03 15:34:39,535 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:39,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 15:34:39,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 15:34:39,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=879, Invalid=2781, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:34:39,537 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 59 states. [2018-12-03 15:34:40,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:40,057 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2018-12-03 15:34:40,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:34:40,057 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 80 [2018-12-03 15:34:40,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:40,058 INFO L225 Difference]: With dead ends: 125 [2018-12-03 15:34:40,058 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 15:34:40,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 102 SyntacticMatches, 36 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2146 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1617, Invalid=4545, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 15:34:40,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 15:34:40,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 15:34:40,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 15:34:40,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-12-03 15:34:40,068 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-12-03 15:34:40,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:40,068 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-12-03 15:34:40,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 15:34:40,068 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-12-03 15:34:40,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 15:34:40,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:40,069 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1] [2018-12-03 15:34:40,069 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:40,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:40,069 INFO L82 PathProgramCache]: Analyzing trace with hash 417798411, now seen corresponding path program 27 times [2018-12-03 15:34:40,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:40,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:40,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:40,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:40,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:40,863 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 380 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:40,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:40,864 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:40,864 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:40,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:40,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:40,864 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:40,874 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:40,874 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:40,939 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:40,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:40,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 380 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:41,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:42,231 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 380 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:42,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:42,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 59 [2018-12-03 15:34:42,250 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:42,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 15:34:42,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 15:34:42,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=839, Invalid=2701, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:34:42,251 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 60 states. [2018-12-03 15:34:42,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:43,000 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-12-03 15:34:43,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 15:34:43,000 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 82 [2018-12-03 15:34:43,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:43,001 INFO L225 Difference]: With dead ends: 127 [2018-12-03 15:34:43,001 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 15:34:43,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 105 SyntacticMatches, 39 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2111 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1618, Invalid=4544, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 15:34:43,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 15:34:43,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 15:34:43,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 15:34:43,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-12-03 15:34:43,011 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2018-12-03 15:34:43,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:43,011 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-12-03 15:34:43,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 15:34:43,012 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-12-03 15:34:43,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 15:34:43,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:43,012 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 19, 1, 1, 1, 1] [2018-12-03 15:34:43,013 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:43,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:43,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1871192825, now seen corresponding path program 28 times [2018-12-03 15:34:43,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:43,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:43,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:43,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:43,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:43,397 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 420 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:43,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:43,398 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:43,398 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:43,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:43,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:43,398 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:43,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:43,408 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:43,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 420 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:43,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:43,812 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 420 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:43,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:43,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 26 [2018-12-03 15:34:43,831 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:43,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:34:43,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:34:43,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=397, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:34:43,832 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 26 states. [2018-12-03 15:34:44,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:44,296 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-12-03 15:34:44,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 15:34:44,296 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 84 [2018-12-03 15:34:44,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:44,297 INFO L225 Difference]: With dead ends: 92 [2018-12-03 15:34:44,297 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 15:34:44,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 146 SyntacticMatches, 38 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=852, Invalid=1404, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:34:44,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 15:34:44,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-12-03 15:34:44,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 15:34:44,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-12-03 15:34:44,305 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 84 [2018-12-03 15:34:44,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:44,305 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-12-03 15:34:44,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:34:44,306 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-12-03 15:34:44,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 15:34:44,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:44,306 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 21, 20, 1, 1, 1, 1] [2018-12-03 15:34:44,306 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:44,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:44,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1432067077, now seen corresponding path program 29 times [2018-12-03 15:34:44,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:44,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:44,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:44,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:44,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 462 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:45,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:45,102 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:45,102 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:45,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:45,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:45,102 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:45,111 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:45,111 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:45,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 15:34:45,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:45,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:46,117 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 462 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:46,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:48,138 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 462 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:48,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:48,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 66 [2018-12-03 15:34:48,159 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:48,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 15:34:48,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 15:34:48,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=3367, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 15:34:48,160 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 65 states. [2018-12-03 15:34:48,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:48,700 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2018-12-03 15:34:48,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 15:34:48,700 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 88 [2018-12-03 15:34:48,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:48,701 INFO L225 Difference]: With dead ends: 137 [2018-12-03 15:34:48,701 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 15:34:48,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 112 SyntacticMatches, 40 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2624 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1955, Invalid=5527, Unknown=0, NotChecked=0, Total=7482 [2018-12-03 15:34:48,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 15:34:48,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 15:34:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 15:34:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-12-03 15:34:48,710 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2018-12-03 15:34:48,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:48,710 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-12-03 15:34:48,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 15:34:48,710 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-12-03 15:34:48,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 15:34:48,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:48,710 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1] [2018-12-03 15:34:48,711 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:48,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:48,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1476838665, now seen corresponding path program 30 times [2018-12-03 15:34:48,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:48,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:48,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:48,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:48,712 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:49,458 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 462 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:49,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:49,459 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:49,459 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:49,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:49,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:49,459 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:49,467 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:49,467 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:49,535 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:49,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:49,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:50,374 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 462 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:50,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 462 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:50,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:50,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 65 [2018-12-03 15:34:50,990 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:50,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 15:34:50,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 15:34:50,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1011, Invalid=3279, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:34:50,992 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 66 states. [2018-12-03 15:34:51,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:51,597 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2018-12-03 15:34:51,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 15:34:51,597 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 90 [2018-12-03 15:34:51,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:51,598 INFO L225 Difference]: With dead ends: 139 [2018-12-03 15:34:51,598 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 15:34:51,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 115 SyntacticMatches, 43 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2585 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1956, Invalid=5526, Unknown=0, NotChecked=0, Total=7482 [2018-12-03 15:34:51,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 15:34:51,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 15:34:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 15:34:51,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-12-03 15:34:51,610 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-12-03 15:34:51,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:51,611 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-12-03 15:34:51,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 15:34:51,611 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-12-03 15:34:51,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 15:34:51,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:51,612 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 21, 1, 1, 1, 1] [2018-12-03 15:34:51,612 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:51,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:51,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1552661773, now seen corresponding path program 31 times [2018-12-03 15:34:51,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:51,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:51,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:51,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:51,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:52,157 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 506 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:52,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:52,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:52,158 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:52,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:52,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:52,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:52,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:52,167 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:52,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:52,281 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 506 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:52,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 506 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:52,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:52,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 28 [2018-12-03 15:34:52,759 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:52,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:34:52,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:34:52,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:34:52,760 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 28 states. [2018-12-03 15:34:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:53,416 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2018-12-03 15:34:53,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 15:34:53,416 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 92 [2018-12-03 15:34:53,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:53,417 INFO L225 Difference]: With dead ends: 100 [2018-12-03 15:34:53,418 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 15:34:53,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 160 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1001, Invalid=1651, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:34:53,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 15:34:53,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-12-03 15:34:53,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 15:34:53,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-03 15:34:53,432 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 92 [2018-12-03 15:34:53,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:53,432 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-03 15:34:53,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:34:53,432 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-03 15:34:53,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 15:34:53,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:53,433 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 22, 1, 1, 1, 1] [2018-12-03 15:34:53,433 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:53,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:53,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2078536679, now seen corresponding path program 32 times [2018-12-03 15:34:53,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:53,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:53,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:53,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:53,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:54,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 552 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:54,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:54,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:54,302 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:54,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:54,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:54,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:54,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:54,310 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:54,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 15:34:54,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:54,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:55,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 552 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:55,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:56,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 552 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:56,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:56,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 72 [2018-12-03 15:34:56,291 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:56,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 15:34:56,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 15:34:56,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1247, Invalid=4009, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 15:34:56,293 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 71 states. [2018-12-03 15:34:57,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:57,220 INFO L93 Difference]: Finished difference Result 149 states and 151 transitions. [2018-12-03 15:34:57,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 15:34:57,220 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 96 [2018-12-03 15:34:57,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:57,221 INFO L225 Difference]: With dead ends: 149 [2018-12-03 15:34:57,221 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 15:34:57,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 122 SyntacticMatches, 44 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3150 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2325, Invalid=6605, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 15:34:57,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 15:34:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 15:34:57,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 15:34:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-03 15:34:57,233 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-12-03 15:34:57,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:57,233 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-03 15:34:57,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 15:34:57,233 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-03 15:34:57,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 15:34:57,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:57,234 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1] [2018-12-03 15:34:57,234 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:57,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:57,235 INFO L82 PathProgramCache]: Analyzing trace with hash 224399075, now seen corresponding path program 33 times [2018-12-03 15:34:57,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:57,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:57,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:57,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:57,236 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:58,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 552 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:58,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:58,385 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:58,385 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:58,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:58,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:58,385 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:58,395 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:58,395 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:58,467 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:58,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:58,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:59,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 552 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:59,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 552 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:00,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:00,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 71 [2018-12-03 15:35:00,264 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:00,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 15:35:00,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 15:35:00,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1199, Invalid=3913, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 15:35:00,265 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 72 states. [2018-12-03 15:35:01,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:01,561 INFO L93 Difference]: Finished difference Result 151 states and 153 transitions. [2018-12-03 15:35:01,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 15:35:01,561 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 98 [2018-12-03 15:35:01,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:01,562 INFO L225 Difference]: With dead ends: 151 [2018-12-03 15:35:01,562 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 15:35:01,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 125 SyntacticMatches, 47 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3107 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2326, Invalid=6604, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 15:35:01,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 15:35:01,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 15:35:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 15:35:01,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-12-03 15:35:01,572 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2018-12-03 15:35:01,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:01,572 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-12-03 15:35:01,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 15:35:01,572 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-12-03 15:35:01,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 15:35:01,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:01,573 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 23, 1, 1, 1, 1] [2018-12-03 15:35:01,573 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:01,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:01,573 INFO L82 PathProgramCache]: Analyzing trace with hash 809589471, now seen corresponding path program 34 times [2018-12-03 15:35:01,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:01,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:01,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:01,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:01,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:02,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 600 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:02,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:02,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:02,041 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:02,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:02,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:02,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:02,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:02,050 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:02,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 600 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:02,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 600 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:02,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:02,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 30 [2018-12-03 15:35:02,761 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:02,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:35:02,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:35:02,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:35:02,762 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 30 states. [2018-12-03 15:35:03,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:03,475 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2018-12-03 15:35:03,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 15:35:03,475 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 100 [2018-12-03 15:35:03,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:03,476 INFO L225 Difference]: With dead ends: 108 [2018-12-03 15:35:03,476 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 15:35:03,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 174 SyntacticMatches, 46 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1322 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1162, Invalid=1918, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:35:03,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 15:35:03,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-12-03 15:35:03,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 15:35:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-12-03 15:35:03,488 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 100 [2018-12-03 15:35:03,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:03,489 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-12-03 15:35:03,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:35:03,489 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-12-03 15:35:03,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 15:35:03,489 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:03,489 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 24, 1, 1, 1, 1] [2018-12-03 15:35:03,489 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:03,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:03,490 INFO L82 PathProgramCache]: Analyzing trace with hash 726349267, now seen corresponding path program 35 times [2018-12-03 15:35:03,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:03,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:03,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:03,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:03,491 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 650 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:04,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:04,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:04,507 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:04,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:04,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:04,508 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:04,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:04,516 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:04,617 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 15:35:04,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:04,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:05,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 650 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:05,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 650 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:06,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:06,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 78 [2018-12-03 15:35:06,513 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:06,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 15:35:06,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 15:35:06,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1455, Invalid=4707, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 15:35:06,514 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 77 states. [2018-12-03 15:35:07,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:07,224 INFO L93 Difference]: Finished difference Result 161 states and 163 transitions. [2018-12-03 15:35:07,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 15:35:07,224 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 104 [2018-12-03 15:35:07,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:07,225 INFO L225 Difference]: With dead ends: 161 [2018-12-03 15:35:07,225 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 15:35:07,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 132 SyntacticMatches, 48 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3724 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2727, Invalid=7779, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 15:35:07,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 15:35:07,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 15:35:07,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 15:35:07,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-12-03 15:35:07,237 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2018-12-03 15:35:07,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:07,237 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-12-03 15:35:07,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 15:35:07,237 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-12-03 15:35:07,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 15:35:07,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:07,238 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1] [2018-12-03 15:35:07,238 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:07,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:07,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1735038159, now seen corresponding path program 36 times [2018-12-03 15:35:07,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:07,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:07,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:07,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:07,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:08,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 650 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:08,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:08,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:08,774 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:08,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:08,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:08,775 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:08,783 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:08,783 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:08,861 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:08,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:08,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:09,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 650 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:09,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:10,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 650 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:10,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:10,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 77 [2018-12-03 15:35:10,811 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:10,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 15:35:10,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 15:35:10,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1403, Invalid=4603, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 15:35:10,812 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 78 states. [2018-12-03 15:35:12,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:12,001 INFO L93 Difference]: Finished difference Result 163 states and 165 transitions. [2018-12-03 15:35:12,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 15:35:12,001 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 106 [2018-12-03 15:35:12,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:12,002 INFO L225 Difference]: With dead ends: 163 [2018-12-03 15:35:12,003 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 15:35:12,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 135 SyntacticMatches, 51 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3677 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2728, Invalid=7778, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 15:35:12,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 15:35:12,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 15:35:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 15:35:12,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-12-03 15:35:12,013 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2018-12-03 15:35:12,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:12,014 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-12-03 15:35:12,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 15:35:12,014 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-12-03 15:35:12,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 15:35:12,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:12,015 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 26, 25, 1, 1, 1, 1] [2018-12-03 15:35:12,015 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:12,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:12,015 INFO L82 PathProgramCache]: Analyzing trace with hash 422454475, now seen corresponding path program 37 times [2018-12-03 15:35:12,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:12,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:12,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:12,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:12,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:13,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 702 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:13,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:13,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:13,030 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:13,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:13,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:13,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:13,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:13,039 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:13,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:13,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 702 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:13,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:14,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 702 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:14,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:14,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 32 [2018-12-03 15:35:14,040 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:14,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:35:14,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:35:14,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=586, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:35:14,041 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 32 states. [2018-12-03 15:35:14,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:14,573 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2018-12-03 15:35:14,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 15:35:14,573 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 108 [2018-12-03 15:35:14,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:14,575 INFO L225 Difference]: With dead ends: 116 [2018-12-03 15:35:14,575 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 15:35:14,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 188 SyntacticMatches, 50 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1536 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1335, Invalid=2205, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:35:14,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 15:35:14,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-12-03 15:35:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 15:35:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-12-03 15:35:14,591 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 108 [2018-12-03 15:35:14,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:14,592 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-12-03 15:35:14,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:35:14,592 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-12-03 15:35:14,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 15:35:14,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:14,593 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 26, 1, 1, 1, 1] [2018-12-03 15:35:14,593 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:14,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:14,593 INFO L82 PathProgramCache]: Analyzing trace with hash -609670721, now seen corresponding path program 38 times [2018-12-03 15:35:14,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:14,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:14,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:14,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:14,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:16,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 756 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:16,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:16,185 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:16,185 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:16,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:16,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:16,185 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:16,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:16,194 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:16,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 15:35:16,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:16,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 756 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:17,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:18,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 756 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:18,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:18,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 84 [2018-12-03 15:35:18,884 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:18,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 15:35:18,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 15:35:18,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1679, Invalid=5461, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 15:35:18,886 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 83 states. [2018-12-03 15:35:19,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:19,970 INFO L93 Difference]: Finished difference Result 173 states and 175 transitions. [2018-12-03 15:35:19,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 15:35:19,970 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 112 [2018-12-03 15:35:19,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:19,971 INFO L225 Difference]: With dead ends: 173 [2018-12-03 15:35:19,971 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 15:35:19,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 142 SyntacticMatches, 52 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4346 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3161, Invalid=9049, Unknown=0, NotChecked=0, Total=12210 [2018-12-03 15:35:19,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 15:35:19,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 15:35:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 15:35:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-12-03 15:35:19,984 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2018-12-03 15:35:19,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:19,984 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-12-03 15:35:19,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 15:35:19,985 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-12-03 15:35:19,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 15:35:19,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:19,985 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1] [2018-12-03 15:35:19,985 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:19,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:19,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1662530373, now seen corresponding path program 39 times [2018-12-03 15:35:19,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:19,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:19,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:19,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:19,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 756 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:21,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:21,249 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:21,249 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:21,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:21,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:21,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:21,258 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:21,259 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:21,345 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:21,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:21,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:24,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 756 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:24,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 756 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:25,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:25,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 83 [2018-12-03 15:35:25,065 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:25,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 15:35:25,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 15:35:25,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1623, Invalid=5349, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 15:35:25,066 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 84 states. [2018-12-03 15:35:25,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:25,964 INFO L93 Difference]: Finished difference Result 175 states and 177 transitions. [2018-12-03 15:35:25,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 15:35:25,964 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 114 [2018-12-03 15:35:25,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:25,965 INFO L225 Difference]: With dead ends: 175 [2018-12-03 15:35:25,965 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 15:35:25,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 145 SyntacticMatches, 55 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4295 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=3162, Invalid=9048, Unknown=0, NotChecked=0, Total=12210 [2018-12-03 15:35:25,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 15:35:25,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-03 15:35:25,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-03 15:35:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-12-03 15:35:25,978 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2018-12-03 15:35:25,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:25,978 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-12-03 15:35:25,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 15:35:25,978 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-12-03 15:35:25,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 15:35:25,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:25,979 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 27, 1, 1, 1, 1] [2018-12-03 15:35:25,979 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:25,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:25,980 INFO L82 PathProgramCache]: Analyzing trace with hash 151625911, now seen corresponding path program 40 times [2018-12-03 15:35:25,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:25,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:25,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:25,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:25,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:26,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 812 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:26,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:26,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:26,523 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:26,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:26,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:26,524 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:26,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:26,533 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:26,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 812 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:26,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:27,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 812 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:27,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:27,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 34 [2018-12-03 15:35:27,515 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:27,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:35:27,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:35:27,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:35:27,516 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 34 states. [2018-12-03 15:35:28,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:28,113 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2018-12-03 15:35:28,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 15:35:28,114 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 116 [2018-12-03 15:35:28,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:28,115 INFO L225 Difference]: With dead ends: 124 [2018-12-03 15:35:28,115 INFO L226 Difference]: Without dead ends: 122 [2018-12-03 15:35:28,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 202 SyntacticMatches, 54 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1766 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1520, Invalid=2512, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:35:28,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-03 15:35:28,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-12-03 15:35:28,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-03 15:35:28,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-12-03 15:35:28,133 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 116 [2018-12-03 15:35:28,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:28,134 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-12-03 15:35:28,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:35:28,134 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-12-03 15:35:28,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-03 15:35:28,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:28,135 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 28, 1, 1, 1, 1] [2018-12-03 15:35:28,135 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:28,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:28,135 INFO L82 PathProgramCache]: Analyzing trace with hash 944557995, now seen corresponding path program 41 times [2018-12-03 15:35:28,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:28,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:28,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:28,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:28,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 870 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:29,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:29,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:29,612 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:29,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:29,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:29,613 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:29,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:29,621 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:29,763 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 15:35:29,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:29,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:31,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 870 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:31,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:32,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 870 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:32,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:32,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 90 [2018-12-03 15:35:32,442 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:32,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 15:35:32,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 15:35:32,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1919, Invalid=6271, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 15:35:32,444 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 89 states. [2018-12-03 15:35:33,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:33,551 INFO L93 Difference]: Finished difference Result 185 states and 187 transitions. [2018-12-03 15:35:33,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 15:35:33,552 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 120 [2018-12-03 15:35:33,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:33,553 INFO L225 Difference]: With dead ends: 185 [2018-12-03 15:35:33,553 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 15:35:33,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 152 SyntacticMatches, 56 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3627, Invalid=10415, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 15:35:33,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 15:35:33,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-12-03 15:35:33,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-03 15:35:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-12-03 15:35:33,572 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2018-12-03 15:35:33,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:33,572 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-12-03 15:35:33,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 15:35:33,572 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-12-03 15:35:33,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 15:35:33,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:33,573 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1] [2018-12-03 15:35:33,573 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:33,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:33,573 INFO L82 PathProgramCache]: Analyzing trace with hash 489076391, now seen corresponding path program 42 times [2018-12-03 15:35:33,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:33,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:33,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:33,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:33,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 870 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:35,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:35,092 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:35,092 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:35,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:35,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:35,092 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:35,110 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:35,110 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:35,202 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:35,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:35,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:36,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 870 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:36,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:37,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 870 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:37,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:37,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 89 [2018-12-03 15:35:37,737 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:37,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 15:35:37,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 15:35:37,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1859, Invalid=6151, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 15:35:37,738 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 90 states. [2018-12-03 15:35:38,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:38,740 INFO L93 Difference]: Finished difference Result 187 states and 189 transitions. [2018-12-03 15:35:38,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 15:35:38,740 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 122 [2018-12-03 15:35:38,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:38,741 INFO L225 Difference]: With dead ends: 187 [2018-12-03 15:35:38,741 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 15:35:38,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 155 SyntacticMatches, 59 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3628, Invalid=10414, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 15:35:38,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 15:35:38,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-12-03 15:35:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-03 15:35:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-12-03 15:35:38,759 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2018-12-03 15:35:38,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:38,759 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-12-03 15:35:38,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 15:35:38,760 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-12-03 15:35:38,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-03 15:35:38,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:38,760 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 29, 1, 1, 1, 1] [2018-12-03 15:35:38,761 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:38,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:38,761 INFO L82 PathProgramCache]: Analyzing trace with hash 857919139, now seen corresponding path program 43 times [2018-12-03 15:35:38,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:38,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:38,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:38,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:38,762 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:39,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 930 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:39,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:39,622 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:39,622 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:39,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:39,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:39,622 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:39,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:39,631 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:39,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 930 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:39,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 930 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:40,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:40,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 36 [2018-12-03 15:35:40,722 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:40,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:35:40,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:35:40,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:35:40,723 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 36 states. [2018-12-03 15:35:41,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:41,401 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2018-12-03 15:35:41,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 15:35:41,401 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 124 [2018-12-03 15:35:41,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:41,403 INFO L225 Difference]: With dead ends: 132 [2018-12-03 15:35:41,403 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 15:35:41,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 216 SyntacticMatches, 58 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2012 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1717, Invalid=2839, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 15:35:41,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 15:35:41,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-12-03 15:35:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-03 15:35:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-12-03 15:35:41,418 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 124 [2018-12-03 15:35:41,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:41,418 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-12-03 15:35:41,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:35:41,418 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-12-03 15:35:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 15:35:41,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:41,419 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 31, 30, 1, 1, 1, 1] [2018-12-03 15:35:41,419 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:41,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:41,419 INFO L82 PathProgramCache]: Analyzing trace with hash 889530263, now seen corresponding path program 44 times [2018-12-03 15:35:41,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:41,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:41,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:41,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:41,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 992 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:42,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:42,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:42,773 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:42,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:42,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:42,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:42,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:42,783 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:42,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 15:35:42,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:42,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:44,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 992 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:44,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:45,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 992 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:46,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:46,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 96 [2018-12-03 15:35:46,013 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:46,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 15:35:46,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 15:35:46,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2175, Invalid=7137, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 15:35:46,015 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 95 states. [2018-12-03 15:35:47,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:47,074 INFO L93 Difference]: Finished difference Result 197 states and 199 transitions. [2018-12-03 15:35:47,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 15:35:47,074 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 128 [2018-12-03 15:35:47,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:47,075 INFO L225 Difference]: With dead ends: 197 [2018-12-03 15:35:47,075 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 15:35:47,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 162 SyntacticMatches, 60 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5734 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4125, Invalid=11877, Unknown=0, NotChecked=0, Total=16002 [2018-12-03 15:35:47,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 15:35:47,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-12-03 15:35:47,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-03 15:35:47,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-12-03 15:35:47,095 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2018-12-03 15:35:47,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:47,095 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-12-03 15:35:47,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 15:35:47,095 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-12-03 15:35:47,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-03 15:35:47,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:47,096 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1] [2018-12-03 15:35:47,096 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:47,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:47,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1611246957, now seen corresponding path program 45 times [2018-12-03 15:35:47,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:47,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:47,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:47,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:47,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 992 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:48,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:48,550 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:48,550 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:48,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:48,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:48,550 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:48,561 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:48,561 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:48,661 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:48,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:48,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:50,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 992 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:50,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 992 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:51,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:51,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 95 [2018-12-03 15:35:51,759 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:51,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 15:35:51,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 15:35:51,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2111, Invalid=7009, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 15:35:51,761 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 96 states. [2018-12-03 15:35:52,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:52,853 INFO L93 Difference]: Finished difference Result 199 states and 201 transitions. [2018-12-03 15:35:52,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 15:35:52,853 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 130 [2018-12-03 15:35:52,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:52,854 INFO L225 Difference]: With dead ends: 199 [2018-12-03 15:35:52,854 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 15:35:52,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 165 SyntacticMatches, 63 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5675 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=4126, Invalid=11876, Unknown=0, NotChecked=0, Total=16002 [2018-12-03 15:35:52,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 15:35:52,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-03 15:35:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 15:35:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-12-03 15:35:52,876 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2018-12-03 15:35:52,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:52,876 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-12-03 15:35:52,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 15:35:52,877 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-12-03 15:35:52,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 15:35:52,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:52,877 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 31, 1, 1, 1, 1] [2018-12-03 15:35:52,878 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:52,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:52,878 INFO L82 PathProgramCache]: Analyzing trace with hash 323530383, now seen corresponding path program 46 times [2018-12-03 15:35:52,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:52,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:52,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:52,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:52,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:53,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 1056 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:53,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:53,899 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:53,899 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:53,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:53,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:53,899 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:53,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:53,907 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:54,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:54,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 1056 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:54,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:55,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 1056 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:55,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:55,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 38 [2018-12-03 15:35:55,330 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:55,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:35:55,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:35:55,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=811, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:35:55,331 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 38 states. [2018-12-03 15:35:56,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:56,012 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2018-12-03 15:35:56,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 15:35:56,012 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 132 [2018-12-03 15:35:56,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:56,014 INFO L225 Difference]: With dead ends: 140 [2018-12-03 15:35:56,014 INFO L226 Difference]: Without dead ends: 138 [2018-12-03 15:35:56,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 230 SyntacticMatches, 62 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2274 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1926, Invalid=3186, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 15:35:56,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-03 15:35:56,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-12-03 15:35:56,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-03 15:35:56,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-12-03 15:35:56,033 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 132 [2018-12-03 15:35:56,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:56,033 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-12-03 15:35:56,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:35:56,033 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-12-03 15:35:56,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-03 15:35:56,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:56,034 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 33, 32, 1, 1, 1, 1] [2018-12-03 15:35:56,034 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:56,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:56,034 INFO L82 PathProgramCache]: Analyzing trace with hash -836685437, now seen corresponding path program 47 times [2018-12-03 15:35:56,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:56,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:56,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:56,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:56,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:57,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 1122 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:57,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:57,515 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:57,515 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:57,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:57,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:57,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:57,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:57,525 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:57,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 15:35:57,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:57,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 1122 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:59,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:01,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 1122 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:01,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:01,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 102 [2018-12-03 15:36:01,228 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:01,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 15:36:01,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 15:36:01,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2447, Invalid=8059, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 15:36:01,229 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 101 states. [2018-12-03 15:36:02,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:02,226 INFO L93 Difference]: Finished difference Result 209 states and 211 transitions. [2018-12-03 15:36:02,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 15:36:02,226 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 136 [2018-12-03 15:36:02,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:02,227 INFO L225 Difference]: With dead ends: 209 [2018-12-03 15:36:02,227 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 15:36:02,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 172 SyntacticMatches, 64 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6500 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=4655, Invalid=13435, Unknown=0, NotChecked=0, Total=18090 [2018-12-03 15:36:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 15:36:02,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-03 15:36:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-03 15:36:02,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-12-03 15:36:02,244 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2018-12-03 15:36:02,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:02,244 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-12-03 15:36:02,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 15:36:02,244 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-12-03 15:36:02,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 15:36:02,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:02,245 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1] [2018-12-03 15:36:02,245 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:02,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:02,245 INFO L82 PathProgramCache]: Analyzing trace with hash -442130305, now seen corresponding path program 48 times [2018-12-03 15:36:02,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:02,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:02,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:02,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:02,246 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:03,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1122 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:03,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:03,856 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:03,856 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:03,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:03,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:03,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:03,865 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:36:03,865 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:36:03,967 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:36:03,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:03,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1122 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:06,003 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1122 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:07,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:07,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 101 [2018-12-03 15:36:07,472 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:07,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 15:36:07,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 15:36:07,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2379, Invalid=7923, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:36:07,473 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 102 states. [2018-12-03 15:36:08,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:08,674 INFO L93 Difference]: Finished difference Result 211 states and 213 transitions. [2018-12-03 15:36:08,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 15:36:08,674 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 138 [2018-12-03 15:36:08,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:08,675 INFO L225 Difference]: With dead ends: 211 [2018-12-03 15:36:08,675 INFO L226 Difference]: Without dead ends: 141 [2018-12-03 15:36:08,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 175 SyntacticMatches, 67 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6437 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=4656, Invalid=13434, Unknown=0, NotChecked=0, Total=18090 [2018-12-03 15:36:08,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-03 15:36:08,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-12-03 15:36:08,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-03 15:36:08,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-12-03 15:36:08,692 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-12-03 15:36:08,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:08,692 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-12-03 15:36:08,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 15:36:08,692 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-12-03 15:36:08,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-03 15:36:08,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:08,693 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 33, 1, 1, 1, 1] [2018-12-03 15:36:08,693 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:08,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:08,693 INFO L82 PathProgramCache]: Analyzing trace with hash 768229499, now seen corresponding path program 49 times [2018-12-03 15:36:08,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:08,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:08,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:08,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:08,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:09,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1190 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:09,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:09,346 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:09,346 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:09,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:09,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:09,346 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:09,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:09,355 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:36:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:09,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:09,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1190 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:09,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1190 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:10,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:10,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 40 [2018-12-03 15:36:10,895 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:10,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:36:10,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:36:10,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:36:10,896 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 40 states. [2018-12-03 15:36:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:11,639 INFO L93 Difference]: Finished difference Result 148 states and 150 transitions. [2018-12-03 15:36:11,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 15:36:11,639 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 140 [2018-12-03 15:36:11,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:11,641 INFO L225 Difference]: With dead ends: 148 [2018-12-03 15:36:11,641 INFO L226 Difference]: Without dead ends: 146 [2018-12-03 15:36:11,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 244 SyntacticMatches, 66 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2552 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2147, Invalid=3553, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:36:11,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-03 15:36:11,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-12-03 15:36:11,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-03 15:36:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-12-03 15:36:11,660 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 140 [2018-12-03 15:36:11,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:11,660 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-12-03 15:36:11,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:36:11,663 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-12-03 15:36:11,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-03 15:36:11,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:11,664 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 35, 34, 1, 1, 1, 1] [2018-12-03 15:36:11,664 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:11,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:11,664 INFO L82 PathProgramCache]: Analyzing trace with hash -932188817, now seen corresponding path program 50 times [2018-12-03 15:36:11,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:11,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:11,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:11,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:11,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:13,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 1260 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:13,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:13,298 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:13,298 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:13,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:13,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:13,298 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:13,307 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:36:13,307 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:36:13,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 15:36:13,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:13,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 1260 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:15,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:17,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 1260 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:17,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:17,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 108 [2018-12-03 15:36:17,303 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:17,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 15:36:17,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 15:36:17,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2735, Invalid=9037, Unknown=0, NotChecked=0, Total=11772 [2018-12-03 15:36:17,305 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 107 states. [2018-12-03 15:36:18,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:18,588 INFO L93 Difference]: Finished difference Result 221 states and 223 transitions. [2018-12-03 15:36:18,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 15:36:18,588 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 144 [2018-12-03 15:36:18,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:18,589 INFO L225 Difference]: With dead ends: 221 [2018-12-03 15:36:18,589 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 15:36:18,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 182 SyntacticMatches, 68 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7314 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5217, Invalid=15089, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 15:36:18,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 15:36:18,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-12-03 15:36:18,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 15:36:18,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-12-03 15:36:18,608 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2018-12-03 15:36:18,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:18,608 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-12-03 15:36:18,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 15:36:18,608 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-12-03 15:36:18,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 15:36:18,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:18,609 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1, 1, 1] [2018-12-03 15:36:18,609 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:18,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:18,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1996726379, now seen corresponding path program 51 times [2018-12-03 15:36:18,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:18,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:18,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:18,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:18,610 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:20,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1260 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:20,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:20,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:20,517 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:20,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:20,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:20,517 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:20,527 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:36:20,527 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:36:20,635 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:36:20,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:20,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1260 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:22,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:24,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1260 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:24,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:24,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 107 [2018-12-03 15:36:24,138 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:24,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 15:36:24,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 15:36:24,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2663, Invalid=8893, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 15:36:24,139 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 108 states. [2018-12-03 15:36:25,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:25,515 INFO L93 Difference]: Finished difference Result 223 states and 225 transitions. [2018-12-03 15:36:25,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 15:36:25,516 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 146 [2018-12-03 15:36:25,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:25,516 INFO L225 Difference]: With dead ends: 223 [2018-12-03 15:36:25,517 INFO L226 Difference]: Without dead ends: 149 [2018-12-03 15:36:25,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 185 SyntacticMatches, 71 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7247 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5218, Invalid=15088, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 15:36:25,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-03 15:36:25,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-12-03 15:36:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-03 15:36:25,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-12-03 15:36:25,535 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2018-12-03 15:36:25,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:25,535 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-12-03 15:36:25,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 15:36:25,535 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-12-03 15:36:25,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-03 15:36:25,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:25,536 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 35, 1, 1, 1, 1] [2018-12-03 15:36:25,536 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:25,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:25,536 INFO L82 PathProgramCache]: Analyzing trace with hash -814316441, now seen corresponding path program 52 times [2018-12-03 15:36:25,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:25,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:25,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:25,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:25,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:26,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 1332 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:26,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:26,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:26,208 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:26,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:26,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:26,208 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:26,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:26,218 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:36:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:26,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:26,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 1332 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:26,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:27,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 1332 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:27,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:27,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 42 [2018-12-03 15:36:27,342 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:27,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 15:36:27,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 15:36:27,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 15:36:27,343 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 42 states. [2018-12-03 15:36:28,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:28,208 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2018-12-03 15:36:28,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 15:36:28,209 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 148 [2018-12-03 15:36:28,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:28,210 INFO L225 Difference]: With dead ends: 156 [2018-12-03 15:36:28,210 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 15:36:28,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 258 SyntacticMatches, 70 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2846 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2380, Invalid=3940, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:36:28,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 15:36:28,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-12-03 15:36:28,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-03 15:36:28,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-12-03 15:36:28,232 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 148 [2018-12-03 15:36:28,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:28,232 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-12-03 15:36:28,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 15:36:28,232 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-12-03 15:36:28,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-03 15:36:28,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:28,233 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 37, 36, 1, 1, 1, 1] [2018-12-03 15:36:28,233 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:28,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:28,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1900043099, now seen corresponding path program 53 times [2018-12-03 15:36:28,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:28,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:28,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:28,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:28,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:30,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 1406 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:30,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:30,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:30,061 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:30,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:30,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:30,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:30,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:36:30,070 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:36:30,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 15:36:30,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:30,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 1406 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:32,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 1406 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:34,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:34,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 114 [2018-12-03 15:36:34,085 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:34,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-03 15:36:34,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-03 15:36:34,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3039, Invalid=10071, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 15:36:34,087 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 113 states. [2018-12-03 15:36:35,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:35,793 INFO L93 Difference]: Finished difference Result 233 states and 235 transitions. [2018-12-03 15:36:35,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 15:36:35,794 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 152 [2018-12-03 15:36:35,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:35,794 INFO L225 Difference]: With dead ends: 233 [2018-12-03 15:36:35,795 INFO L226 Difference]: Without dead ends: 155 [2018-12-03 15:36:35,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 192 SyntacticMatches, 72 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8176 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5811, Invalid=16839, Unknown=0, NotChecked=0, Total=22650 [2018-12-03 15:36:35,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-03 15:36:35,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-12-03 15:36:35,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-03 15:36:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-12-03 15:36:35,814 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2018-12-03 15:36:35,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:35,814 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-12-03 15:36:35,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-03 15:36:35,814 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-12-03 15:36:35,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-03 15:36:35,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:35,815 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1, 1, 1] [2018-12-03 15:36:35,815 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:35,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:35,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1700745815, now seen corresponding path program 54 times [2018-12-03 15:36:35,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:35,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:35,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:35,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:35,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:37,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1406 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:37,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:37,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:37,585 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:37,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:37,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:37,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:37,594 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:36:37,595 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:36:37,736 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:36:37,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:37,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:39,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1406 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:39,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:41,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1406 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:41,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:41,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 113 [2018-12-03 15:36:41,820 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:41,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-03 15:36:41,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-03 15:36:41,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2963, Invalid=9919, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 15:36:41,822 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 114 states. [2018-12-03 15:36:43,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:43,320 INFO L93 Difference]: Finished difference Result 235 states and 237 transitions. [2018-12-03 15:36:43,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 15:36:43,321 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 154 [2018-12-03 15:36:43,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:43,321 INFO L225 Difference]: With dead ends: 235 [2018-12-03 15:36:43,321 INFO L226 Difference]: Without dead ends: 157 [2018-12-03 15:36:43,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 195 SyntacticMatches, 75 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8105 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5812, Invalid=16838, Unknown=0, NotChecked=0, Total=22650 [2018-12-03 15:36:43,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-03 15:36:43,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-12-03 15:36:43,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-03 15:36:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-12-03 15:36:43,341 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2018-12-03 15:36:43,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:43,341 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-12-03 15:36:43,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-03 15:36:43,341 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-12-03 15:36:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 15:36:43,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:43,342 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 37, 1, 1, 1, 1] [2018-12-03 15:36:43,342 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:43,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:43,343 INFO L82 PathProgramCache]: Analyzing trace with hash -845383085, now seen corresponding path program 55 times [2018-12-03 15:36:43,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:43,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:43,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:43,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:43,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 1482 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:44,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:44,073 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:44,074 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:44,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:44,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:44,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:44,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:44,083 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:36:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:44,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:44,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 1482 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:44,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 1482 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:45,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:45,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 44 [2018-12-03 15:36:45,418 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:45,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 15:36:45,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 15:36:45,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=908, Invalid=1072, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 15:36:45,420 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 44 states. [2018-12-03 15:36:46,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:46,454 INFO L93 Difference]: Finished difference Result 164 states and 166 transitions. [2018-12-03 15:36:46,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 15:36:46,454 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 156 [2018-12-03 15:36:46,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:46,455 INFO L225 Difference]: With dead ends: 164 [2018-12-03 15:36:46,455 INFO L226 Difference]: Without dead ends: 162 [2018-12-03 15:36:46,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 272 SyntacticMatches, 74 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3156 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2625, Invalid=4347, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 15:36:46,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-03 15:36:46,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-12-03 15:36:46,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-03 15:36:46,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-12-03 15:36:46,476 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 156 [2018-12-03 15:36:46,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:46,476 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-12-03 15:36:46,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 15:36:46,476 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-12-03 15:36:46,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-03 15:36:46,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:46,477 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 39, 38, 1, 1, 1, 1] [2018-12-03 15:36:46,477 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:46,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:46,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1583446855, now seen corresponding path program 56 times [2018-12-03 15:36:46,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:46,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:46,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:46,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:46,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:48,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 1560 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:48,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:48,481 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:48,481 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:48,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:48,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:48,481 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:48,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:36:48,493 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:36:48,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 15:36:48,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:48,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:51,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 1560 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:51,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:53,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 1560 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:53,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:53,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 120 [2018-12-03 15:36:53,194 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:53,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-12-03 15:36:53,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-12-03 15:36:53,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3359, Invalid=11161, Unknown=0, NotChecked=0, Total=14520 [2018-12-03 15:36:53,195 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 119 states. [2018-12-03 15:36:54,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:54,736 INFO L93 Difference]: Finished difference Result 245 states and 247 transitions. [2018-12-03 15:36:54,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 15:36:54,737 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 160 [2018-12-03 15:36:54,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:54,738 INFO L225 Difference]: With dead ends: 245 [2018-12-03 15:36:54,738 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 15:36:54,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 202 SyntacticMatches, 76 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9086 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=6437, Invalid=18685, Unknown=0, NotChecked=0, Total=25122 [2018-12-03 15:36:54,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 15:36:54,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-12-03 15:36:54,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-03 15:36:54,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-12-03 15:36:54,759 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2018-12-03 15:36:54,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:54,759 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-12-03 15:36:54,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-12-03 15:36:54,760 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-12-03 15:36:54,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 15:36:54,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:54,760 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1, 1, 1] [2018-12-03 15:36:54,760 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:54,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:54,761 INFO L82 PathProgramCache]: Analyzing trace with hash 176666179, now seen corresponding path program 57 times [2018-12-03 15:36:54,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:54,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:54,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:54,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:54,762 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:57,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1560 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:57,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:57,066 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:57,066 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:57,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:57,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:57,066 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:57,075 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:36:57,075 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:36:57,190 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:36:57,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:57,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1560 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:59,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:01,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1560 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:01,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:01,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 119 [2018-12-03 15:37:01,748 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:01,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-12-03 15:37:01,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-12-03 15:37:01,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3279, Invalid=11001, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 15:37:01,750 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 120 states. [2018-12-03 15:37:03,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:03,353 INFO L93 Difference]: Finished difference Result 247 states and 249 transitions. [2018-12-03 15:37:03,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 15:37:03,353 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 162 [2018-12-03 15:37:03,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:03,354 INFO L225 Difference]: With dead ends: 247 [2018-12-03 15:37:03,354 INFO L226 Difference]: Without dead ends: 165 [2018-12-03 15:37:03,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 205 SyntacticMatches, 79 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9011 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=6438, Invalid=18684, Unknown=0, NotChecked=0, Total=25122 [2018-12-03 15:37:03,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-03 15:37:03,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-12-03 15:37:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 15:37:03,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-12-03 15:37:03,375 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2018-12-03 15:37:03,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:03,375 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-12-03 15:37:03,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-12-03 15:37:03,375 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-12-03 15:37:03,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-03 15:37:03,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:03,376 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 40, 39, 1, 1, 1, 1] [2018-12-03 15:37:03,376 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:03,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:03,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1175134783, now seen corresponding path program 58 times [2018-12-03 15:37:03,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:03,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:03,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:37:03,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:03,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:04,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 1640 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:04,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:04,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:04,171 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:04,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:37:04,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:04,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:04,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:37:04,184 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:37:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:04,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 1640 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:04,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:05,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 1640 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:05,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:05,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 46 [2018-12-03 15:37:05,619 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:05,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 15:37:05,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 15:37:05,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:37:05,620 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 46 states. [2018-12-03 15:37:06,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:06,790 INFO L93 Difference]: Finished difference Result 172 states and 174 transitions. [2018-12-03 15:37:06,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 15:37:06,790 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 164 [2018-12-03 15:37:06,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:06,792 INFO L225 Difference]: With dead ends: 172 [2018-12-03 15:37:06,792 INFO L226 Difference]: Without dead ends: 170 [2018-12-03 15:37:06,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 286 SyntacticMatches, 78 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3482 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2882, Invalid=4774, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 15:37:06,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-03 15:37:06,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-12-03 15:37:06,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-03 15:37:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-12-03 15:37:06,816 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 164 [2018-12-03 15:37:06,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:06,816 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-12-03 15:37:06,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 15:37:06,816 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-12-03 15:37:06,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-03 15:37:06,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:06,817 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 41, 40, 1, 1, 1, 1] [2018-12-03 15:37:06,817 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:06,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:06,818 INFO L82 PathProgramCache]: Analyzing trace with hash 773999923, now seen corresponding path program 59 times [2018-12-03 15:37:06,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:06,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:06,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:37:06,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:06,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 1722 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:08,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:08,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:08,950 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:08,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:37:08,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:08,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:08,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:37:08,959 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:37:09,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-12-03 15:37:09,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:37:09,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:12,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 1722 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:12,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 1722 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:14,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:14,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 126 [2018-12-03 15:37:14,115 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:14,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-12-03 15:37:14,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-12-03 15:37:14,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3695, Invalid=12307, Unknown=0, NotChecked=0, Total=16002 [2018-12-03 15:37:14,117 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 125 states. [2018-12-03 15:37:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:15,870 INFO L93 Difference]: Finished difference Result 257 states and 259 transitions. [2018-12-03 15:37:15,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 15:37:15,870 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 168 [2018-12-03 15:37:15,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:15,871 INFO L225 Difference]: With dead ends: 257 [2018-12-03 15:37:15,872 INFO L226 Difference]: Without dead ends: 171 [2018-12-03 15:37:15,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 212 SyntacticMatches, 80 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10044 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=7095, Invalid=20627, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 15:37:15,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-03 15:37:15,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-12-03 15:37:15,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-03 15:37:15,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-12-03 15:37:15,899 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2018-12-03 15:37:15,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:15,899 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-12-03 15:37:15,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-12-03 15:37:15,899 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-12-03 15:37:15,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-03 15:37:15,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:15,900 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1, 1, 1] [2018-12-03 15:37:15,901 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:15,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:15,901 INFO L82 PathProgramCache]: Analyzing trace with hash -926168017, now seen corresponding path program 60 times [2018-12-03 15:37:15,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:15,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:15,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:37:15,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:15,902 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:18,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1722 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:18,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:18,481 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:18,481 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:18,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:37:18,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:18,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:18,491 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:37:18,492 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:37:18,614 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:37:18,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:37:18,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:21,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1722 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:21,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:23,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1722 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:23,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:23,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 125 [2018-12-03 15:37:23,857 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:23,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-12-03 15:37:23,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-12-03 15:37:23,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3611, Invalid=12139, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 15:37:23,859 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 126 states. [2018-12-03 15:37:25,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:25,447 INFO L93 Difference]: Finished difference Result 259 states and 261 transitions. [2018-12-03 15:37:25,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 15:37:25,447 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 170 [2018-12-03 15:37:25,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:25,448 INFO L225 Difference]: With dead ends: 259 [2018-12-03 15:37:25,448 INFO L226 Difference]: Without dead ends: 173 [2018-12-03 15:37:25,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 215 SyntacticMatches, 83 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9965 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=7096, Invalid=20626, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 15:37:25,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-03 15:37:25,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-12-03 15:37:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-12-03 15:37:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2018-12-03 15:37:25,481 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2018-12-03 15:37:25,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:25,481 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2018-12-03 15:37:25,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-12-03 15:37:25,481 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2018-12-03 15:37:25,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-03 15:37:25,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:25,483 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 42, 41, 1, 1, 1, 1] [2018-12-03 15:37:25,483 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:25,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:25,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1594981419, now seen corresponding path program 61 times [2018-12-03 15:37:25,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:25,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:25,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:37:25,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:25,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:26,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 1806 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:26,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:26,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:26,404 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:26,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:37:26,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:26,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:26,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:37:26,414 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:37:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:26,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 1806 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:26,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:28,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 1806 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:28,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:28,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 48 [2018-12-03 15:37:28,033 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:28,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 15:37:28,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 15:37:28,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 15:37:28,034 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 48 states. [2018-12-03 15:37:29,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:29,026 INFO L93 Difference]: Finished difference Result 180 states and 182 transitions. [2018-12-03 15:37:29,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 15:37:29,027 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 172 [2018-12-03 15:37:29,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:29,028 INFO L225 Difference]: With dead ends: 180 [2018-12-03 15:37:29,028 INFO L226 Difference]: Without dead ends: 178 [2018-12-03 15:37:29,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 300 SyntacticMatches, 82 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3824 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3151, Invalid=5221, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 15:37:29,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-03 15:37:29,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-12-03 15:37:29,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 15:37:29,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-12-03 15:37:29,059 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 172 [2018-12-03 15:37:29,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:29,059 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-12-03 15:37:29,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 15:37:29,059 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-12-03 15:37:29,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-03 15:37:29,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:29,060 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 43, 42, 1, 1, 1, 1] [2018-12-03 15:37:29,060 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:29,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:29,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1196544287, now seen corresponding path program 62 times [2018-12-03 15:37:29,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:29,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:29,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:37:29,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:29,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:31,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 1892 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:31,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:31,385 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:31,385 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:31,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:37:31,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:31,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:31,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:37:31,395 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:37:31,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 15:37:31,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:37:31,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:34,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 1892 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:34,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 1892 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:37,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:37,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 132 [2018-12-03 15:37:37,348 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:37,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-12-03 15:37:37,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-12-03 15:37:37,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4047, Invalid=13509, Unknown=0, NotChecked=0, Total=17556 [2018-12-03 15:37:37,351 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 131 states. [2018-12-03 15:37:38,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:38,942 INFO L93 Difference]: Finished difference Result 269 states and 271 transitions. [2018-12-03 15:37:38,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 15:37:38,942 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 176 [2018-12-03 15:37:38,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:38,943 INFO L225 Difference]: With dead ends: 269 [2018-12-03 15:37:38,943 INFO L226 Difference]: Without dead ends: 179 [2018-12-03 15:37:38,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 222 SyntacticMatches, 84 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11050 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=7785, Invalid=22665, Unknown=0, NotChecked=0, Total=30450 [2018-12-03 15:37:38,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-03 15:37:38,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-12-03 15:37:38,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-12-03 15:37:38,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-12-03 15:37:38,969 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2018-12-03 15:37:38,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:38,969 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-12-03 15:37:38,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-12-03 15:37:38,970 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-12-03 15:37:38,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-03 15:37:38,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:38,971 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1, 1, 1] [2018-12-03 15:37:38,971 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:38,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:38,971 INFO L82 PathProgramCache]: Analyzing trace with hash -889547749, now seen corresponding path program 63 times [2018-12-03 15:37:38,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:38,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:38,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:37:38,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:38,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:41,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1892 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:41,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:41,301 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:41,301 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:41,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:37:41,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:41,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:41,337 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:37:41,338 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:37:41,470 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:37:41,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:37:41,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:44,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1892 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:44,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:46,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1892 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:46,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:46,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 131 [2018-12-03 15:37:46,854 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:46,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-12-03 15:37:46,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-12-03 15:37:46,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3959, Invalid=13333, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 15:37:46,856 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 132 states. [2018-12-03 15:37:48,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:48,798 INFO L93 Difference]: Finished difference Result 271 states and 273 transitions. [2018-12-03 15:37:48,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 15:37:48,798 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 178 [2018-12-03 15:37:48,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:48,799 INFO L225 Difference]: With dead ends: 271 [2018-12-03 15:37:48,799 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 15:37:48,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 225 SyntacticMatches, 87 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10967 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=7786, Invalid=22664, Unknown=0, NotChecked=0, Total=30450 [2018-12-03 15:37:48,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 15:37:48,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-12-03 15:37:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-03 15:37:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-12-03 15:37:48,824 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2018-12-03 15:37:48,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:48,824 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-12-03 15:37:48,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-12-03 15:37:48,824 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-12-03 15:37:48,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-03 15:37:48,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:48,825 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 44, 43, 1, 1, 1, 1] [2018-12-03 15:37:48,825 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:48,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:48,825 INFO L82 PathProgramCache]: Analyzing trace with hash 125732887, now seen corresponding path program 64 times [2018-12-03 15:37:48,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:48,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:48,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:37:48,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:48,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:49,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3872 backedges. 1980 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:49,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:49,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:49,797 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:49,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:37:49,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:49,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:49,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:37:49,805 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:37:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:49,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3872 backedges. 1980 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:50,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:51,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3872 backedges. 1980 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:51,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:51,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 50 [2018-12-03 15:37:51,441 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:51,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 15:37:51,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 15:37:51,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=1369, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 15:37:51,442 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 50 states. [2018-12-03 15:37:52,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:52,828 INFO L93 Difference]: Finished difference Result 188 states and 190 transitions. [2018-12-03 15:37:52,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 15:37:52,828 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 180 [2018-12-03 15:37:52,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:52,829 INFO L225 Difference]: With dead ends: 188 [2018-12-03 15:37:52,829 INFO L226 Difference]: Without dead ends: 186 [2018-12-03 15:37:52,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 314 SyntacticMatches, 86 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4182 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3432, Invalid=5688, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 15:37:52,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-03 15:37:52,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-12-03 15:37:52,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-12-03 15:37:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-12-03 15:37:52,856 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 180 [2018-12-03 15:37:52,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:52,856 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-12-03 15:37:52,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 15:37:52,856 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-12-03 15:37:52,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-03 15:37:52,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:52,857 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 45, 44, 1, 1, 1, 1] [2018-12-03 15:37:52,857 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:52,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:52,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1723922677, now seen corresponding path program 65 times [2018-12-03 15:37:52,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:52,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:52,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:37:52,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:52,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:55,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 2070 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:55,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:55,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:55,666 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:55,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:37:55,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:55,667 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:55,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:37:55,675 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:37:55,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 15:37:55,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:37:55,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:59,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 2070 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:59,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 2070 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:01,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:01,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 138 [2018-12-03 15:38:01,713 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:01,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-12-03 15:38:01,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-12-03 15:38:01,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4415, Invalid=14767, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 15:38:01,715 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 137 states. [2018-12-03 15:38:03,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:03,607 INFO L93 Difference]: Finished difference Result 281 states and 283 transitions. [2018-12-03 15:38:03,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 15:38:03,608 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 184 [2018-12-03 15:38:03,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:03,609 INFO L225 Difference]: With dead ends: 281 [2018-12-03 15:38:03,609 INFO L226 Difference]: Without dead ends: 187 [2018-12-03 15:38:03,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 232 SyntacticMatches, 88 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12104 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=8507, Invalid=24799, Unknown=0, NotChecked=0, Total=33306 [2018-12-03 15:38:03,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-03 15:38:03,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-12-03 15:38:03,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-03 15:38:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-12-03 15:38:03,645 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2018-12-03 15:38:03,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:03,645 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-12-03 15:38:03,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-12-03 15:38:03,646 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-12-03 15:38:03,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-03 15:38:03,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:03,647 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1, 1, 1] [2018-12-03 15:38:03,647 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:03,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:03,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1000141305, now seen corresponding path program 66 times [2018-12-03 15:38:03,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:03,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:03,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:03,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:03,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 2070 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:06,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:06,226 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:06,226 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:06,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:06,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:06,226 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:06,235 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:38:06,235 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:38:06,373 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:38:06,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:06,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:09,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 2070 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:09,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:12,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 2070 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:12,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:12,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 137 [2018-12-03 15:38:12,354 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:12,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-12-03 15:38:12,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-12-03 15:38:12,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4323, Invalid=14583, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 15:38:12,355 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 138 states. [2018-12-03 15:38:14,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:14,506 INFO L93 Difference]: Finished difference Result 283 states and 285 transitions. [2018-12-03 15:38:14,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 15:38:14,506 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 186 [2018-12-03 15:38:14,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:14,507 INFO L225 Difference]: With dead ends: 283 [2018-12-03 15:38:14,508 INFO L226 Difference]: Without dead ends: 189 [2018-12-03 15:38:14,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 235 SyntacticMatches, 91 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12017 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=8508, Invalid=24798, Unknown=0, NotChecked=0, Total=33306 [2018-12-03 15:38:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-03 15:38:14,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-12-03 15:38:14,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-03 15:38:14,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-12-03 15:38:14,535 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2018-12-03 15:38:14,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:14,535 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-12-03 15:38:14,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-12-03 15:38:14,536 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-12-03 15:38:14,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-03 15:38:14,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:14,537 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 46, 45, 1, 1, 1, 1] [2018-12-03 15:38:14,537 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:14,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:14,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1230944765, now seen corresponding path program 67 times [2018-12-03 15:38:14,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:14,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:14,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:14,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:14,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 2162 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:15,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:15,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:15,603 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:15,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:15,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:15,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:15,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:15,612 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:38:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:15,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 2162 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:15,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:17,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 2162 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:17,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:17,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 52 [2018-12-03 15:38:17,360 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:17,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:38:17,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:38:17,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:38:17,361 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 52 states. [2018-12-03 15:38:18,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:18,684 INFO L93 Difference]: Finished difference Result 196 states and 198 transitions. [2018-12-03 15:38:18,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 15:38:18,685 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 188 [2018-12-03 15:38:18,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:18,686 INFO L225 Difference]: With dead ends: 196 [2018-12-03 15:38:18,686 INFO L226 Difference]: Without dead ends: 194 [2018-12-03 15:38:18,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 328 SyntacticMatches, 90 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3725, Invalid=6175, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 15:38:18,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-03 15:38:18,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-12-03 15:38:18,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-12-03 15:38:18,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-12-03 15:38:18,714 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 188 [2018-12-03 15:38:18,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:18,715 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-12-03 15:38:18,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:38:18,715 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-12-03 15:38:18,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-03 15:38:18,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:18,716 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 47, 46, 1, 1, 1, 1] [2018-12-03 15:38:18,716 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:18,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:18,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1538846455, now seen corresponding path program 68 times [2018-12-03 15:38:18,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:18,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:18,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:18,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:18,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 2256 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:21,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:21,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:21,458 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:21,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:21,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:21,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:21,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:38:21,467 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:38:21,707 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-12-03 15:38:21,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:21,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:25,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 2256 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:25,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:28,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 2256 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:28,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:28,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 144 [2018-12-03 15:38:28,143 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:28,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-12-03 15:38:28,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-12-03 15:38:28,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4799, Invalid=16081, Unknown=0, NotChecked=0, Total=20880 [2018-12-03 15:38:28,144 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 143 states. [2018-12-03 15:38:30,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:30,113 INFO L93 Difference]: Finished difference Result 293 states and 295 transitions. [2018-12-03 15:38:30,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 15:38:30,114 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 192 [2018-12-03 15:38:30,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:30,115 INFO L225 Difference]: With dead ends: 293 [2018-12-03 15:38:30,115 INFO L226 Difference]: Without dead ends: 195 [2018-12-03 15:38:30,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 242 SyntacticMatches, 92 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13206 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=9261, Invalid=27029, Unknown=0, NotChecked=0, Total=36290 [2018-12-03 15:38:30,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-03 15:38:30,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-12-03 15:38:30,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-03 15:38:30,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-12-03 15:38:30,143 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2018-12-03 15:38:30,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:30,143 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-12-03 15:38:30,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-12-03 15:38:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-12-03 15:38:30,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-03 15:38:30,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:30,144 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1, 1, 1] [2018-12-03 15:38:30,144 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:30,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:30,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1328268813, now seen corresponding path program 69 times [2018-12-03 15:38:30,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:30,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:30,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:30,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:30,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:32,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 2256 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:32,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:32,899 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:32,899 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:32,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:32,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:32,899 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:32,907 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:38:32,908 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:38:33,054 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:38:33,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:33,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:36,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 2256 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:36,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 2256 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:39,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:39,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 143 [2018-12-03 15:38:39,512 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:39,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-12-03 15:38:39,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-12-03 15:38:39,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4703, Invalid=15889, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 15:38:39,513 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 144 states. [2018-12-03 15:38:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:41,544 INFO L93 Difference]: Finished difference Result 295 states and 297 transitions. [2018-12-03 15:38:41,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 15:38:41,544 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 194 [2018-12-03 15:38:41,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:41,545 INFO L225 Difference]: With dead ends: 295 [2018-12-03 15:38:41,545 INFO L226 Difference]: Without dead ends: 197 [2018-12-03 15:38:41,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 245 SyntacticMatches, 95 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13115 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=9262, Invalid=27028, Unknown=0, NotChecked=0, Total=36290 [2018-12-03 15:38:41,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-03 15:38:41,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-12-03 15:38:41,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-03 15:38:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-12-03 15:38:41,573 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2018-12-03 15:38:41,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:41,573 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-12-03 15:38:41,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-12-03 15:38:41,574 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-12-03 15:38:41,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-03 15:38:41,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:41,574 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 48, 47, 1, 1, 1, 1] [2018-12-03 15:38:41,575 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:41,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:41,575 INFO L82 PathProgramCache]: Analyzing trace with hash 742962671, now seen corresponding path program 70 times [2018-12-03 15:38:41,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:41,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:41,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:41,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:41,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:42,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4608 backedges. 2352 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:42,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:42,722 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:42,723 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:42,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:42,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:42,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:42,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:42,732 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:38:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:42,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:42,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4608 backedges. 2352 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:42,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4608 backedges. 2352 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:45,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:45,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 51] total 54 [2018-12-03 15:38:45,015 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:45,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 15:38:45,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 15:38:45,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:38:45,016 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 54 states. [2018-12-03 15:38:46,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:46,301 INFO L93 Difference]: Finished difference Result 204 states and 206 transitions. [2018-12-03 15:38:46,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 15:38:46,301 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 196 [2018-12-03 15:38:46,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:46,302 INFO L225 Difference]: With dead ends: 204 [2018-12-03 15:38:46,302 INFO L226 Difference]: Without dead ends: 202 [2018-12-03 15:38:46,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 342 SyntacticMatches, 94 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4946 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4030, Invalid=6682, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 15:38:46,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-03 15:38:46,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-12-03 15:38:46,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-03 15:38:46,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-12-03 15:38:46,331 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 196 [2018-12-03 15:38:46,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:46,332 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-12-03 15:38:46,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 15:38:46,332 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-12-03 15:38:46,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-03 15:38:46,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:46,333 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 49, 48, 1, 1, 1, 1] [2018-12-03 15:38:46,333 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:46,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:46,334 INFO L82 PathProgramCache]: Analyzing trace with hash -821131037, now seen corresponding path program 71 times [2018-12-03 15:38:46,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:46,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:46,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:46,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:46,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4802 backedges. 2450 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:49,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:49,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:49,531 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:49,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:49,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:49,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:49,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:38:49,539 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:38:49,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-03 15:38:49,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:49,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:53,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4802 backedges. 2450 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:53,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:56,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4802 backedges. 2450 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:56,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:56,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 150 [2018-12-03 15:38:56,862 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:56,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-12-03 15:38:56,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-12-03 15:38:56,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5199, Invalid=17451, Unknown=0, NotChecked=0, Total=22650 [2018-12-03 15:38:56,864 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 149 states. [2018-12-03 15:38:59,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:59,204 INFO L93 Difference]: Finished difference Result 305 states and 307 transitions. [2018-12-03 15:38:59,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 15:38:59,205 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 200 [2018-12-03 15:38:59,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:59,206 INFO L225 Difference]: With dead ends: 305 [2018-12-03 15:38:59,206 INFO L226 Difference]: Without dead ends: 203 [2018-12-03 15:38:59,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 252 SyntacticMatches, 96 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14356 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=10047, Invalid=29355, Unknown=0, NotChecked=0, Total=39402 [2018-12-03 15:38:59,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-03 15:38:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-12-03 15:38:59,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-03 15:38:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-12-03 15:38:59,248 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2018-12-03 15:38:59,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:59,248 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-12-03 15:38:59,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-12-03 15:38:59,249 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-12-03 15:38:59,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-03 15:38:59,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:59,250 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1, 1, 1] [2018-12-03 15:38:59,250 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:59,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:59,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1801644065, now seen corresponding path program 72 times [2018-12-03 15:38:59,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:59,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:59,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:59,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:59,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:02,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2450 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:02,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:02,285 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:39:02,285 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:39:02,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:39:02,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:02,285 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:39:02,294 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:39:02,294 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:39:02,443 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:39:02,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:39:02,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:06,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2450 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:06,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:39:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2450 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:09,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:39:09,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 149 [2018-12-03 15:39:09,640 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:39:09,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-12-03 15:39:09,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-12-03 15:39:09,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5099, Invalid=17251, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 15:39:09,642 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 150 states. [2018-12-03 15:39:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:11,645 INFO L93 Difference]: Finished difference Result 307 states and 309 transitions. [2018-12-03 15:39:11,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 15:39:11,646 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 202 [2018-12-03 15:39:11,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:11,647 INFO L225 Difference]: With dead ends: 307 [2018-12-03 15:39:11,647 INFO L226 Difference]: Without dead ends: 205 [2018-12-03 15:39:11,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 255 SyntacticMatches, 99 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14261 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=10048, Invalid=29354, Unknown=0, NotChecked=0, Total=39402 [2018-12-03 15:39:11,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-12-03 15:39:11,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-12-03 15:39:11,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-03 15:39:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-12-03 15:39:11,678 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2018-12-03 15:39:11,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:11,678 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-12-03 15:39:11,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-12-03 15:39:11,678 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-12-03 15:39:11,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-03 15:39:11,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:11,679 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 50, 49, 1, 1, 1, 1] [2018-12-03 15:39:11,679 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:11,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:11,680 INFO L82 PathProgramCache]: Analyzing trace with hash 818141147, now seen corresponding path program 73 times [2018-12-03 15:39:11,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:11,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:11,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:39:11,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:11,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:12,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5000 backedges. 2550 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:12,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:12,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:39:12,902 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:39:12,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:39:12,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:12,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:39:12,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:12,910 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:39:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:13,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5000 backedges. 2550 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:13,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:39:15,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5000 backedges. 2550 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:15,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:39:15,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53, 53] total 56 [2018-12-03 15:39:15,256 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:39:15,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 15:39:15,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 15:39:15,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=1702, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 15:39:15,257 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 56 states. [2018-12-03 15:39:16,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:16,591 INFO L93 Difference]: Finished difference Result 212 states and 214 transitions. [2018-12-03 15:39:16,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 15:39:16,592 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 204 [2018-12-03 15:39:16,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:16,593 INFO L225 Difference]: With dead ends: 212 [2018-12-03 15:39:16,593 INFO L226 Difference]: Without dead ends: 210 [2018-12-03 15:39:16,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 356 SyntacticMatches, 98 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5352 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4347, Invalid=7209, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 15:39:16,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-03 15:39:16,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-12-03 15:39:16,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-12-03 15:39:16,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-12-03 15:39:16,633 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 204 [2018-12-03 15:39:16,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:16,633 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-12-03 15:39:16,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 15:39:16,633 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-12-03 15:39:16,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-03 15:39:16,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:16,634 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 51, 50, 1, 1, 1, 1] [2018-12-03 15:39:16,634 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:16,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:16,635 INFO L82 PathProgramCache]: Analyzing trace with hash -66136881, now seen corresponding path program 74 times [2018-12-03 15:39:16,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:16,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:16,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:16,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:16,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:20,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 2652 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:20,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:20,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:39:20,041 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:39:20,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:39:20,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:20,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:39:20,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:39:20,051 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:39:20,344 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 15:39:20,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:39:20,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:24,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 2652 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:24,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:39:27,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 2652 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:27,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:39:27,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 156 [2018-12-03 15:39:27,686 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:39:27,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-12-03 15:39:27,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-12-03 15:39:27,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5615, Invalid=18877, Unknown=0, NotChecked=0, Total=24492 [2018-12-03 15:39:27,688 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 155 states. [2018-12-03 15:39:30,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:30,276 INFO L93 Difference]: Finished difference Result 317 states and 319 transitions. [2018-12-03 15:39:30,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 15:39:30,276 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 208 [2018-12-03 15:39:30,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:30,277 INFO L225 Difference]: With dead ends: 317 [2018-12-03 15:39:30,277 INFO L226 Difference]: Without dead ends: 211 [2018-12-03 15:39:30,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 262 SyntacticMatches, 100 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15554 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=10865, Invalid=31777, Unknown=0, NotChecked=0, Total=42642 [2018-12-03 15:39:30,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-03 15:39:30,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-12-03 15:39:30,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-03 15:39:30,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-12-03 15:39:30,310 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2018-12-03 15:39:30,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:30,310 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-12-03 15:39:30,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-12-03 15:39:30,310 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-12-03 15:39:30,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-03 15:39:30,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:30,311 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1, 1, 1] [2018-12-03 15:39:30,311 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:30,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:30,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1015850955, now seen corresponding path program 75 times [2018-12-03 15:39:30,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:30,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:30,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:39:30,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:30,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 2652 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:33,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:33,547 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:39:33,547 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:39:33,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:39:33,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:33,547 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:39:33,556 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:39:33,556 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:39:33,699 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:39:33,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:39:33,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:37,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 2652 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:37,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:39:41,433 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 2652 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:41,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:39:41,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 155 [2018-12-03 15:39:41,453 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:39:41,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-12-03 15:39:41,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-12-03 15:39:41,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5511, Invalid=18669, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 15:39:41,455 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 156 states. [2018-12-03 15:39:43,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:43,791 INFO L93 Difference]: Finished difference Result 319 states and 321 transitions. [2018-12-03 15:39:43,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 15:39:43,791 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 210 [2018-12-03 15:39:43,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:43,792 INFO L225 Difference]: With dead ends: 319 [2018-12-03 15:39:43,793 INFO L226 Difference]: Without dead ends: 213 [2018-12-03 15:39:43,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 265 SyntacticMatches, 103 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15455 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=10866, Invalid=31776, Unknown=0, NotChecked=0, Total=42642 [2018-12-03 15:39:43,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-12-03 15:39:43,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-12-03 15:39:43,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-03 15:39:43,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2018-12-03 15:39:43,826 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2018-12-03 15:39:43,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:43,826 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2018-12-03 15:39:43,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-12-03 15:39:43,826 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2018-12-03 15:39:43,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-03 15:39:43,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:43,827 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 52, 51, 1, 1, 1, 1] [2018-12-03 15:39:43,827 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:43,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:43,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1424075719, now seen corresponding path program 76 times [2018-12-03 15:39:43,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:43,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:43,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:39:43,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:43,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:45,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5408 backedges. 2756 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:45,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:45,436 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:39:45,437 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:39:45,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:39:45,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:45,437 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:39:45,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:45,445 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:39:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:45,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 5408 backedges. 2756 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:45,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:39:47,703 INFO L134 CoverageAnalysis]: Checked inductivity of 5408 backedges. 2756 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:47,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:39:47,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 55] total 58 [2018-12-03 15:39:47,723 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:39:47,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 15:39:47,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 15:39:47,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:39:47,724 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 58 states. [2018-12-03 15:39:49,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:49,170 INFO L93 Difference]: Finished difference Result 220 states and 222 transitions. [2018-12-03 15:39:49,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 15:39:49,170 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 212 [2018-12-03 15:39:49,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:49,171 INFO L225 Difference]: With dead ends: 220 [2018-12-03 15:39:49,171 INFO L226 Difference]: Without dead ends: 218 [2018-12-03 15:39:49,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 370 SyntacticMatches, 102 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5774 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4676, Invalid=7756, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 15:39:49,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-03 15:39:49,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-12-03 15:39:49,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-03 15:39:49,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-12-03 15:39:49,212 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 212 [2018-12-03 15:39:49,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:49,212 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-12-03 15:39:49,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 15:39:49,212 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-12-03 15:39:49,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-12-03 15:39:49,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:49,213 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 53, 52, 1, 1, 1, 1] [2018-12-03 15:39:49,214 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:49,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:49,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1946735291, now seen corresponding path program 77 times [2018-12-03 15:39:49,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:49,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:49,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:49,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:49,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5618 backedges. 2862 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:53,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:53,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:39:53,007 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:39:53,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:39:53,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:53,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:39:53,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:39:53,015 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:39:53,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-12-03 15:39:53,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:39:53,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:57,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5618 backedges. 2862 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:57,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:40:01,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5618 backedges. 2862 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:01,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:40:01,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 162 [2018-12-03 15:40:01,546 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:40:01,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-12-03 15:40:01,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-12-03 15:40:01,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6047, Invalid=20359, Unknown=0, NotChecked=0, Total=26406 [2018-12-03 15:40:01,548 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 161 states. [2018-12-03 15:40:03,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:03,993 INFO L93 Difference]: Finished difference Result 329 states and 331 transitions. [2018-12-03 15:40:03,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 15:40:03,993 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 216 [2018-12-03 15:40:03,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:03,994 INFO L225 Difference]: With dead ends: 329 [2018-12-03 15:40:03,994 INFO L226 Difference]: Without dead ends: 219 [2018-12-03 15:40:03,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 272 SyntacticMatches, 104 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16800 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=11715, Invalid=34295, Unknown=0, NotChecked=0, Total=46010 [2018-12-03 15:40:03,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-03 15:40:04,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-12-03 15:40:04,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-12-03 15:40:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2018-12-03 15:40:04,030 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 216 [2018-12-03 15:40:04,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:04,030 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2018-12-03 15:40:04,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-12-03 15:40:04,030 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2018-12-03 15:40:04,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-03 15:40:04,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:04,031 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1, 1, 1] [2018-12-03 15:40:04,032 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:04,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:04,032 INFO L82 PathProgramCache]: Analyzing trace with hash -34477641, now seen corresponding path program 78 times [2018-12-03 15:40:04,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:04,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:04,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:40:04,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:04,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2862 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:07,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:07,848 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:40:07,848 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:40:07,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:40:07,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:07,848 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:40:07,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:40:07,857 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:40:08,025 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:40:08,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:40:08,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:40:12,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2862 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:12,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:40:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2862 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:16,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:40:16,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 161 [2018-12-03 15:40:16,130 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:40:16,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-12-03 15:40:16,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-12-03 15:40:16,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5939, Invalid=20143, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 15:40:16,132 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 162 states. [2018-12-03 15:40:18,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:18,702 INFO L93 Difference]: Finished difference Result 331 states and 333 transitions. [2018-12-03 15:40:18,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 15:40:18,702 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 218 [2018-12-03 15:40:18,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:18,703 INFO L225 Difference]: With dead ends: 331 [2018-12-03 15:40:18,703 INFO L226 Difference]: Without dead ends: 221 [2018-12-03 15:40:18,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 275 SyntacticMatches, 107 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16697 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=11716, Invalid=34294, Unknown=0, NotChecked=0, Total=46010 [2018-12-03 15:40:18,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-12-03 15:40:18,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-12-03 15:40:18,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-12-03 15:40:18,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 222 transitions. [2018-12-03 15:40:18,739 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 222 transitions. Word has length 218 [2018-12-03 15:40:18,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:18,739 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 222 transitions. [2018-12-03 15:40:18,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-12-03 15:40:18,739 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 222 transitions. [2018-12-03 15:40:18,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-03 15:40:18,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:18,740 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 54, 53, 1, 1, 1, 1] [2018-12-03 15:40:18,740 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:18,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:18,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1309593165, now seen corresponding path program 79 times [2018-12-03 15:40:18,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:18,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:18,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:40:18,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:18,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:20,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 2970 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:20,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:20,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:40:20,131 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:40:20,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:40:20,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:20,132 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:40:20,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:20,141 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:40:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:20,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:40:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 2970 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:20,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:40:22,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 2970 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:22,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:40:22,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 57, 57] total 60 [2018-12-03 15:40:22,884 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:40:22,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 15:40:22,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 15:40:22,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1716, Invalid=1944, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:40:22,885 INFO L87 Difference]: Start difference. First operand 221 states and 222 transitions. Second operand 60 states. [2018-12-03 15:40:24,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:24,379 INFO L93 Difference]: Finished difference Result 228 states and 230 transitions. [2018-12-03 15:40:24,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-12-03 15:40:24,380 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 220 [2018-12-03 15:40:24,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:24,381 INFO L225 Difference]: With dead ends: 228 [2018-12-03 15:40:24,381 INFO L226 Difference]: Without dead ends: 226 [2018-12-03 15:40:24,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 384 SyntacticMatches, 106 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6212 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5017, Invalid=8323, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 15:40:24,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-03 15:40:24,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-12-03 15:40:24,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-12-03 15:40:24,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-12-03 15:40:24,418 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 220 [2018-12-03 15:40:24,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:24,418 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-12-03 15:40:24,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 15:40:24,418 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-12-03 15:40:24,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-03 15:40:24,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:24,419 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 55, 54, 1, 1, 1, 1] [2018-12-03 15:40:24,419 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:24,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:24,420 INFO L82 PathProgramCache]: Analyzing trace with hash 281772711, now seen corresponding path program 80 times [2018-12-03 15:40:24,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:24,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:24,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:24,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:24,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:28,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 3080 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:28,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:28,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:40:28,633 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:40:28,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:40:28,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:28,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:40:28,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:40:28,642 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:40:28,953 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 15:40:28,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:40:28,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:40:33,737 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 3080 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:33,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:40:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 3080 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:37,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:40:37,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 168 [2018-12-03 15:40:37,672 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:40:37,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-12-03 15:40:37,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-12-03 15:40:37,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6495, Invalid=21897, Unknown=0, NotChecked=0, Total=28392 [2018-12-03 15:40:37,674 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 167 states. [2018-12-03 15:40:40,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:40,322 INFO L93 Difference]: Finished difference Result 341 states and 343 transitions. [2018-12-03 15:40:40,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 15:40:40,322 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 224 [2018-12-03 15:40:40,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:40,323 INFO L225 Difference]: With dead ends: 341 [2018-12-03 15:40:40,323 INFO L226 Difference]: Without dead ends: 227 [2018-12-03 15:40:40,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 282 SyntacticMatches, 108 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18094 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=12597, Invalid=36909, Unknown=0, NotChecked=0, Total=49506 [2018-12-03 15:40:40,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-03 15:40:40,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-12-03 15:40:40,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-03 15:40:40,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2018-12-03 15:40:40,368 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 224 [2018-12-03 15:40:40,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:40,368 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2018-12-03 15:40:40,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-12-03 15:40:40,368 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2018-12-03 15:40:40,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-03 15:40:40,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:40,369 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1, 1, 1] [2018-12-03 15:40:40,369 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:40,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:40,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1989926307, now seen corresponding path program 81 times [2018-12-03 15:40:40,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:40,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:40,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:40:40,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:40,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:44,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3080 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:44,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:44,486 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:40:44,486 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:40:44,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:40:44,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:44,487 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:40:44,496 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:40:44,496 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:40:44,665 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:40:44,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:40:44,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:40:49,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3080 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:49,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:40:53,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3080 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:53,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:40:53,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 167 [2018-12-03 15:40:53,326 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:40:53,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-12-03 15:40:53,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-12-03 15:40:53,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6383, Invalid=21673, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 15:40:53,328 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 168 states. [2018-12-03 15:40:56,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:56,002 INFO L93 Difference]: Finished difference Result 343 states and 345 transitions. [2018-12-03 15:40:56,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-12-03 15:40:56,002 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 226 [2018-12-03 15:40:56,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:56,003 INFO L225 Difference]: With dead ends: 343 [2018-12-03 15:40:56,003 INFO L226 Difference]: Without dead ends: 229 [2018-12-03 15:40:56,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 285 SyntacticMatches, 111 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17987 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=12598, Invalid=36908, Unknown=0, NotChecked=0, Total=49506 [2018-12-03 15:40:56,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-12-03 15:40:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-12-03 15:40:56,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-12-03 15:40:56,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2018-12-03 15:40:56,041 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 226 [2018-12-03 15:40:56,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:56,041 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2018-12-03 15:40:56,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-12-03 15:40:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2018-12-03 15:40:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-12-03 15:40:56,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:56,042 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 56, 55, 1, 1, 1, 1] [2018-12-03 15:40:56,043 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:56,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:56,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1446942305, now seen corresponding path program 82 times [2018-12-03 15:40:56,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:56,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:56,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:40:56,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:56,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:57,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6272 backedges. 3192 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:57,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:57,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:40:57,857 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:40:57,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:40:57,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:57,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:40:57,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:57,866 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:40:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:58,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:40:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6272 backedges. 3192 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:58,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6272 backedges. 3192 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:00,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:00,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59, 59] total 62 [2018-12-03 15:41:00,415 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:00,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 15:41:00,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 15:41:00,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1835, Invalid=2071, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 15:41:00,416 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 62 states. [2018-12-03 15:41:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:02,336 INFO L93 Difference]: Finished difference Result 236 states and 238 transitions. [2018-12-03 15:41:02,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-12-03 15:41:02,336 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 228 [2018-12-03 15:41:02,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:02,338 INFO L225 Difference]: With dead ends: 236 [2018-12-03 15:41:02,338 INFO L226 Difference]: Without dead ends: 234 [2018-12-03 15:41:02,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 398 SyntacticMatches, 110 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6666 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5370, Invalid=8910, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 15:41:02,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-03 15:41:02,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-12-03 15:41:02,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-12-03 15:41:02,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2018-12-03 15:41:02,377 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 228 [2018-12-03 15:41:02,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:02,377 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2018-12-03 15:41:02,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 15:41:02,377 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2018-12-03 15:41:02,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-12-03 15:41:02,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:02,378 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 57, 56, 1, 1, 1, 1] [2018-12-03 15:41:02,378 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:02,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:02,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1264196461, now seen corresponding path program 83 times [2018-12-03 15:41:02,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:02,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:02,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:02,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:02,380 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:06,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 3306 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:06,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:06,486 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:06,486 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:06,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:06,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:06,486 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:06,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:41:06,495 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:41:06,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-12-03 15:41:06,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:06,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:11,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 3306 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:11,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:15,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 3306 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:15,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:15,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115, 115] total 174 [2018-12-03 15:41:15,823 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:15,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-12-03 15:41:15,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-12-03 15:41:15,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6959, Invalid=23491, Unknown=0, NotChecked=0, Total=30450 [2018-12-03 15:41:15,825 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 173 states. [2018-12-03 15:41:18,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:18,902 INFO L93 Difference]: Finished difference Result 353 states and 355 transitions. [2018-12-03 15:41:18,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-12-03 15:41:18,903 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 232 [2018-12-03 15:41:18,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:18,904 INFO L225 Difference]: With dead ends: 353 [2018-12-03 15:41:18,904 INFO L226 Difference]: Without dead ends: 235 [2018-12-03 15:41:18,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 292 SyntacticMatches, 112 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19436 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=13511, Invalid=39619, Unknown=0, NotChecked=0, Total=53130 [2018-12-03 15:41:18,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-12-03 15:41:18,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-12-03 15:41:18,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-12-03 15:41:18,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2018-12-03 15:41:18,946 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 232 [2018-12-03 15:41:18,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:18,946 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2018-12-03 15:41:18,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-12-03 15:41:18,946 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2018-12-03 15:41:18,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-12-03 15:41:18,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:18,948 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1, 1, 1] [2018-12-03 15:41:18,948 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:18,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:18,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1289323407, now seen corresponding path program 84 times [2018-12-03 15:41:18,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:18,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:18,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:18,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:18,950 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 3306 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:23,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:23,297 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:23,297 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:23,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:23,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:23,297 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:23,305 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:41:23,305 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:41:23,485 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:41:23,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:23,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:28,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 3306 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:28,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:32,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 3306 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:32,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:32,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116, 116, 116] total 173 [2018-12-03 15:41:32,843 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:32,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-12-03 15:41:32,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-12-03 15:41:32,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6843, Invalid=23259, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 15:41:32,846 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 174 states. [2018-12-03 15:41:35,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:35,769 INFO L93 Difference]: Finished difference Result 355 states and 357 transitions. [2018-12-03 15:41:35,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-12-03 15:41:35,769 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 234 [2018-12-03 15:41:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:35,770 INFO L225 Difference]: With dead ends: 355 [2018-12-03 15:41:35,771 INFO L226 Difference]: Without dead ends: 237 [2018-12-03 15:41:35,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 295 SyntacticMatches, 115 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19325 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=13512, Invalid=39618, Unknown=0, NotChecked=0, Total=53130 [2018-12-03 15:41:35,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-12-03 15:41:35,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-12-03 15:41:35,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-12-03 15:41:35,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2018-12-03 15:41:35,811 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 234 [2018-12-03 15:41:35,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:35,812 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2018-12-03 15:41:35,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-12-03 15:41:35,812 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2018-12-03 15:41:35,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-12-03 15:41:35,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:35,813 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 58, 57, 1, 1, 1, 1] [2018-12-03 15:41:35,813 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:35,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:35,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1499376757, now seen corresponding path program 85 times [2018-12-03 15:41:35,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:35,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:35,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:35,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:35,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:37,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6728 backedges. 3422 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:37,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:37,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:37,978 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:37,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:37,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:37,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:37,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:37,990 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:38,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6728 backedges. 3422 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:38,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6728 backedges. 3422 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:40,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:40,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61, 61] total 64 [2018-12-03 15:41:40,615 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:40,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 15:41:40,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 15:41:40,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 15:41:40,617 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 64 states. [2018-12-03 15:41:42,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:42,359 INFO L93 Difference]: Finished difference Result 244 states and 246 transitions. [2018-12-03 15:41:42,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-12-03 15:41:42,359 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 236 [2018-12-03 15:41:42,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:42,361 INFO L225 Difference]: With dead ends: 244 [2018-12-03 15:41:42,361 INFO L226 Difference]: Without dead ends: 242 [2018-12-03 15:41:42,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 412 SyntacticMatches, 114 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7136 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5735, Invalid=9517, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 15:41:42,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-12-03 15:41:42,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-12-03 15:41:42,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-12-03 15:41:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2018-12-03 15:41:42,406 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 236 [2018-12-03 15:41:42,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:42,407 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2018-12-03 15:41:42,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 15:41:42,407 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2018-12-03 15:41:42,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-12-03 15:41:42,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:42,408 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 59, 58, 1, 1, 1, 1] [2018-12-03 15:41:42,408 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:42,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:42,408 INFO L82 PathProgramCache]: Analyzing trace with hash 174520447, now seen corresponding path program 86 times [2018-12-03 15:41:42,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:42,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:42,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:42,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:42,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6962 backedges. 3540 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:46,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:46,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:46,883 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:46,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:46,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:46,884 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:46,891 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:41:46,891 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:41:47,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-12-03 15:41:47,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:47,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:52,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6962 backedges. 3540 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:52,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:57,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6962 backedges. 3540 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:57,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:57,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119, 119] total 180 [2018-12-03 15:41:57,227 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:57,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-12-03 15:41:57,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-12-03 15:41:57,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7439, Invalid=25141, Unknown=0, NotChecked=0, Total=32580 [2018-12-03 15:41:57,229 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 179 states. [2018-12-03 15:42:00,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:00,155 INFO L93 Difference]: Finished difference Result 365 states and 367 transitions. [2018-12-03 15:42:00,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-12-03 15:42:00,155 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 240 [2018-12-03 15:42:00,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:00,156 INFO L225 Difference]: With dead ends: 365 [2018-12-03 15:42:00,156 INFO L226 Difference]: Without dead ends: 243 [2018-12-03 15:42:00,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 302 SyntacticMatches, 116 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20826 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=14457, Invalid=42425, Unknown=0, NotChecked=0, Total=56882 [2018-12-03 15:42:00,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-12-03 15:42:00,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-12-03 15:42:00,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-12-03 15:42:00,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2018-12-03 15:42:00,199 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 240 [2018-12-03 15:42:00,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:00,200 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 244 transitions. [2018-12-03 15:42:00,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-12-03 15:42:00,200 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 244 transitions. [2018-12-03 15:42:00,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-12-03 15:42:00,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:00,201 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1, 1, 1] [2018-12-03 15:42:00,201 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:00,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:00,201 INFO L82 PathProgramCache]: Analyzing trace with hash -277226629, now seen corresponding path program 87 times [2018-12-03 15:42:00,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:00,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:00,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:00,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:00,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:04,814 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3540 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:04,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:04,815 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:04,815 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:04,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:04,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:04,815 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:04,825 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:42:04,825 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:42:05,008 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:42:05,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:05,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3540 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:10,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:14,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3540 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:14,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:14,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120, 120, 120] total 179 [2018-12-03 15:42:14,842 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:14,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-12-03 15:42:14,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-12-03 15:42:14,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7319, Invalid=24901, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 15:42:14,844 INFO L87 Difference]: Start difference. First operand 243 states and 244 transitions. Second operand 180 states. [2018-12-03 15:42:17,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:17,915 INFO L93 Difference]: Finished difference Result 367 states and 369 transitions. [2018-12-03 15:42:17,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-12-03 15:42:17,916 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 242 [2018-12-03 15:42:17,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:17,917 INFO L225 Difference]: With dead ends: 367 [2018-12-03 15:42:17,917 INFO L226 Difference]: Without dead ends: 245 [2018-12-03 15:42:17,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 305 SyntacticMatches, 119 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20711 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=14458, Invalid=42424, Unknown=0, NotChecked=0, Total=56882 [2018-12-03 15:42:17,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-12-03 15:42:17,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-12-03 15:42:17,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-12-03 15:42:17,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 246 transitions. [2018-12-03 15:42:17,960 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 246 transitions. Word has length 242 [2018-12-03 15:42:17,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:17,960 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 246 transitions. [2018-12-03 15:42:17,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-12-03 15:42:17,960 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 246 transitions. [2018-12-03 15:42:17,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-12-03 15:42:17,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:17,961 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 60, 59, 1, 1, 1, 1] [2018-12-03 15:42:17,961 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:17,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:17,962 INFO L82 PathProgramCache]: Analyzing trace with hash -614469769, now seen corresponding path program 88 times [2018-12-03 15:42:17,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:17,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:17,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:17,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:17,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:19,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7200 backedges. 3660 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:19,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:19,981 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:19,982 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:19,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:19,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:19,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:19,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:19,990 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:42:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:20,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 7200 backedges. 3660 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:20,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:22,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7200 backedges. 3660 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:22,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:22,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 63, 63] total 66 [2018-12-03 15:42:22,843 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:22,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 15:42:22,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 15:42:22,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2085, Invalid=2337, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 15:42:22,844 INFO L87 Difference]: Start difference. First operand 245 states and 246 transitions. Second operand 66 states. [2018-12-03 15:42:24,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:24,811 INFO L93 Difference]: Finished difference Result 252 states and 254 transitions. [2018-12-03 15:42:24,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-12-03 15:42:24,812 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 244 [2018-12-03 15:42:24,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:24,814 INFO L225 Difference]: With dead ends: 252 [2018-12-03 15:42:24,814 INFO L226 Difference]: Without dead ends: 250 [2018-12-03 15:42:24,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 426 SyntacticMatches, 118 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7622 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=6112, Invalid=10144, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 15:42:24,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-12-03 15:42:24,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-12-03 15:42:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-03 15:42:24,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2018-12-03 15:42:24,859 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 244 [2018-12-03 15:42:24,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:24,859 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2018-12-03 15:42:24,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 15:42:24,859 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2018-12-03 15:42:24,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-12-03 15:42:24,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:24,860 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 61, 60, 1, 1, 1, 1] [2018-12-03 15:42:24,860 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:24,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:24,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1163771499, now seen corresponding path program 89 times [2018-12-03 15:42:24,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:24,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:24,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:24,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:24,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:29,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7442 backedges. 3782 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:29,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:29,610 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:29,611 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:29,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:29,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:29,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:29,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:42:29,620 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:42:29,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 62 check-sat command(s) [2018-12-03 15:42:29,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:30,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:35,820 INFO L134 CoverageAnalysis]: Checked inductivity of 7442 backedges. 3782 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:35,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 7442 backedges. 3782 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:40,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:40,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 123, 123] total 186 [2018-12-03 15:42:40,547 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:40,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 185 states [2018-12-03 15:42:40,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2018-12-03 15:42:40,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7935, Invalid=26847, Unknown=0, NotChecked=0, Total=34782 [2018-12-03 15:42:40,549 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 185 states. [2018-12-03 15:42:43,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:43,715 INFO L93 Difference]: Finished difference Result 377 states and 379 transitions. [2018-12-03 15:42:43,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-12-03 15:42:43,716 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 248 [2018-12-03 15:42:43,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:43,717 INFO L225 Difference]: With dead ends: 377 [2018-12-03 15:42:43,717 INFO L226 Difference]: Without dead ends: 251 [2018-12-03 15:42:43,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 312 SyntacticMatches, 120 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22264 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=15435, Invalid=45327, Unknown=0, NotChecked=0, Total=60762 [2018-12-03 15:42:43,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-12-03 15:42:43,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-12-03 15:42:43,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-03 15:42:43,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 252 transitions. [2018-12-03 15:42:43,764 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 252 transitions. Word has length 248 [2018-12-03 15:42:43,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:43,764 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 252 transitions. [2018-12-03 15:42:43,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 185 states. [2018-12-03 15:42:43,764 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 252 transitions. [2018-12-03 15:42:43,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-12-03 15:42:43,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:43,765 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1, 1, 1] [2018-12-03 15:42:43,765 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:43,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:43,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1439425895, now seen corresponding path program 90 times [2018-12-03 15:42:43,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:43,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:43,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:43,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:43,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:48,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 3782 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:48,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:48,533 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:48,533 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:48,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:48,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:48,533 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:48,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:42:48,542 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:42:48,725 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:42:48,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:48,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:54,801 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 3782 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:54,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 3782 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:59,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:59,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124, 124, 124] total 185 [2018-12-03 15:42:59,394 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:59,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-12-03 15:42:59,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-12-03 15:42:59,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7811, Invalid=26599, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 15:42:59,396 INFO L87 Difference]: Start difference. First operand 251 states and 252 transitions. Second operand 186 states. [2018-12-03 15:43:02,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:02,713 INFO L93 Difference]: Finished difference Result 379 states and 381 transitions. [2018-12-03 15:43:02,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-12-03 15:43:02,713 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 250 [2018-12-03 15:43:02,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:02,714 INFO L225 Difference]: With dead ends: 379 [2018-12-03 15:43:02,714 INFO L226 Difference]: Without dead ends: 253 [2018-12-03 15:43:02,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 315 SyntacticMatches, 123 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22145 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=15436, Invalid=45326, Unknown=0, NotChecked=0, Total=60762 [2018-12-03 15:43:02,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-12-03 15:43:02,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-12-03 15:43:02,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-12-03 15:43:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 254 transitions. [2018-12-03 15:43:02,760 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 254 transitions. Word has length 250 [2018-12-03 15:43:02,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:02,760 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 254 transitions. [2018-12-03 15:43:02,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-12-03 15:43:02,760 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 254 transitions. [2018-12-03 15:43:02,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-03 15:43:02,761 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:02,761 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 62, 61, 1, 1, 1, 1] [2018-12-03 15:43:02,761 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:02,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:02,761 INFO L82 PathProgramCache]: Analyzing trace with hash 55328099, now seen corresponding path program 91 times [2018-12-03 15:43:02,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:02,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:02,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:43:02,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:02,763 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 7688 backedges. 3906 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:04,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:04,759 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:04,760 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:04,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:04,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:04,760 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:04,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:04,769 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:43:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:04,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7688 backedges. 3906 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:05,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 7688 backedges. 3906 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:07,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:07,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65, 65] total 68 [2018-12-03 15:43:07,871 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:07,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 15:43:07,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 15:43:07,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2216, Invalid=2476, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 15:43:07,872 INFO L87 Difference]: Start difference. First operand 253 states and 254 transitions. Second operand 68 states. [2018-12-03 15:43:09,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:09,957 INFO L93 Difference]: Finished difference Result 260 states and 262 transitions. [2018-12-03 15:43:09,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-12-03 15:43:09,957 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 252 [2018-12-03 15:43:09,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:09,958 INFO L225 Difference]: With dead ends: 260 [2018-12-03 15:43:09,958 INFO L226 Difference]: Without dead ends: 258 [2018-12-03 15:43:09,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 440 SyntacticMatches, 122 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8124 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=6501, Invalid=10791, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 15:43:09,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-12-03 15:43:10,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-12-03 15:43:10,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-03 15:43:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 258 transitions. [2018-12-03 15:43:10,007 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 258 transitions. Word has length 252 [2018-12-03 15:43:10,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:10,007 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 258 transitions. [2018-12-03 15:43:10,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 15:43:10,007 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 258 transitions. [2018-12-03 15:43:10,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-12-03 15:43:10,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:10,008 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 63, 62, 1, 1, 1, 1] [2018-12-03 15:43:10,008 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:10,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:10,009 INFO L82 PathProgramCache]: Analyzing trace with hash -514247081, now seen corresponding path program 92 times [2018-12-03 15:43:10,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:10,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:10,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:10,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:10,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 7938 backedges. 4032 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:15,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:15,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:15,064 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:15,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:15,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:15,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:15,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:43:15,074 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:43:15,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-12-03 15:43:15,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:43:15,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:21,622 INFO L134 CoverageAnalysis]: Checked inductivity of 7938 backedges. 4032 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:21,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:26,697 INFO L134 CoverageAnalysis]: Checked inductivity of 7938 backedges. 4032 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:26,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:26,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127, 127] total 192 [2018-12-03 15:43:26,718 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:26,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 191 states [2018-12-03 15:43:26,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2018-12-03 15:43:26,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8447, Invalid=28609, Unknown=0, NotChecked=0, Total=37056 [2018-12-03 15:43:26,720 INFO L87 Difference]: Start difference. First operand 257 states and 258 transitions. Second operand 191 states. [2018-12-03 15:43:30,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:30,354 INFO L93 Difference]: Finished difference Result 389 states and 391 transitions. [2018-12-03 15:43:30,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-12-03 15:43:30,354 INFO L78 Accepts]: Start accepts. Automaton has 191 states. Word has length 256 [2018-12-03 15:43:30,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:30,356 INFO L225 Difference]: With dead ends: 389 [2018-12-03 15:43:30,356 INFO L226 Difference]: Without dead ends: 259 [2018-12-03 15:43:30,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 699 GetRequests, 322 SyntacticMatches, 124 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23750 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=16445, Invalid=48325, Unknown=0, NotChecked=0, Total=64770 [2018-12-03 15:43:30,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-12-03 15:43:30,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-12-03 15:43:30,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-12-03 15:43:30,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-12-03 15:43:30,404 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 256 [2018-12-03 15:43:30,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:30,405 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-12-03 15:43:30,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 191 states. [2018-12-03 15:43:30,405 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-12-03 15:43:30,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-12-03 15:43:30,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:30,406 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1, 1, 1] [2018-12-03 15:43:30,406 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:30,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:30,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1080123053, now seen corresponding path program 93 times [2018-12-03 15:43:30,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:30,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:30,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:43:30,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:30,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 4032 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:35,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:35,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:35,606 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:35,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:35,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:35,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:35,614 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:43:35,614 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:43:35,809 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:43:35,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:43:35,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 4032 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:41,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:46,963 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 4032 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:46,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:46,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128, 128, 128] total 191 [2018-12-03 15:43:46,983 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:46,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-12-03 15:43:46,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-12-03 15:43:46,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8319, Invalid=28353, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 15:43:46,985 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 192 states. [2018-12-03 15:43:50,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:50,229 INFO L93 Difference]: Finished difference Result 391 states and 393 transitions. [2018-12-03 15:43:50,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-12-03 15:43:50,229 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 258 [2018-12-03 15:43:50,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:50,230 INFO L225 Difference]: With dead ends: 391 [2018-12-03 15:43:50,230 INFO L226 Difference]: Without dead ends: 261 [2018-12-03 15:43:50,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 325 SyntacticMatches, 127 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23627 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=16446, Invalid=48324, Unknown=0, NotChecked=0, Total=64770 [2018-12-03 15:43:50,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-12-03 15:43:50,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-12-03 15:43:50,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-12-03 15:43:50,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 262 transitions. [2018-12-03 15:43:50,279 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 262 transitions. Word has length 258 [2018-12-03 15:43:50,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:50,280 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 262 transitions. [2018-12-03 15:43:50,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-12-03 15:43:50,280 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 262 transitions. [2018-12-03 15:43:50,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-12-03 15:43:50,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:50,281 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 64, 63, 1, 1, 1, 1] [2018-12-03 15:43:50,281 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:50,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:50,281 INFO L82 PathProgramCache]: Analyzing trace with hash 573914447, now seen corresponding path program 94 times [2018-12-03 15:43:50,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:50,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:50,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:43:50,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:50,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:52,354 INFO L134 CoverageAnalysis]: Checked inductivity of 8192 backedges. 4160 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:52,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:52,355 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:52,355 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:52,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:52,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:52,355 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:52,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:52,366 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:43:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:52,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:52,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8192 backedges. 4160 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:52,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:55,972 INFO L134 CoverageAnalysis]: Checked inductivity of 8192 backedges. 4032 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:55,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:55,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 73 [2018-12-03 15:43:55,992 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:55,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 15:43:55,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 15:43:55,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2434, Invalid=2968, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:43:55,993 INFO L87 Difference]: Start difference. First operand 261 states and 262 transitions. Second operand 71 states. [2018-12-03 15:43:58,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:58,256 INFO L93 Difference]: Finished difference Result 268 states and 270 transitions. [2018-12-03 15:43:58,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-12-03 15:43:58,256 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 260 [2018-12-03 15:43:58,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:58,258 INFO L225 Difference]: With dead ends: 268 [2018-12-03 15:43:58,258 INFO L226 Difference]: Without dead ends: 266 [2018-12-03 15:43:58,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 713 GetRequests, 452 SyntacticMatches, 125 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8908 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=6916, Invalid=11990, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 15:43:58,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-03 15:43:58,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-12-03 15:43:58,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-03 15:43:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2018-12-03 15:43:58,309 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 260 [2018-12-03 15:43:58,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:58,309 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2018-12-03 15:43:58,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 15:43:58,309 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2018-12-03 15:43:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-12-03 15:43:58,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:58,311 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 65, 64, 1, 1, 1, 1] [2018-12-03 15:43:58,311 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:58,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:58,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1655201859, now seen corresponding path program 95 times [2018-12-03 15:43:58,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:58,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:58,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:58,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:58,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 8450 backedges. 4290 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:03,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:03,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:03,692 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:03,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:03,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:03,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:03,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:44:03,702 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:44:04,125 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-12-03 15:44:04,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:04,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:10,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8450 backedges. 4290 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:10,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:15,873 INFO L134 CoverageAnalysis]: Checked inductivity of 8450 backedges. 4290 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:15,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:15,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131, 131] total 198 [2018-12-03 15:44:15,894 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:15,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 197 states [2018-12-03 15:44:15,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2018-12-03 15:44:15,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8975, Invalid=30427, Unknown=0, NotChecked=0, Total=39402 [2018-12-03 15:44:15,896 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 197 states. [2018-12-03 15:44:19,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:19,608 INFO L93 Difference]: Finished difference Result 401 states and 403 transitions. [2018-12-03 15:44:19,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-12-03 15:44:19,609 INFO L78 Accepts]: Start accepts. Automaton has 197 states. Word has length 264 [2018-12-03 15:44:19,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:19,610 INFO L225 Difference]: With dead ends: 401 [2018-12-03 15:44:19,610 INFO L226 Difference]: Without dead ends: 267 [2018-12-03 15:44:19,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 721 GetRequests, 332 SyntacticMatches, 128 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25284 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=17487, Invalid=51419, Unknown=0, NotChecked=0, Total=68906 [2018-12-03 15:44:19,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-12-03 15:44:19,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-12-03 15:44:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-12-03 15:44:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 268 transitions. [2018-12-03 15:44:19,662 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 268 transitions. Word has length 264 [2018-12-03 15:44:19,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:19,662 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 268 transitions. [2018-12-03 15:44:19,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 197 states. [2018-12-03 15:44:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 268 transitions. [2018-12-03 15:44:19,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-12-03 15:44:19,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:19,663 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1, 1, 1] [2018-12-03 15:44:19,664 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:19,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:19,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1967198015, now seen corresponding path program 96 times [2018-12-03 15:44:19,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:19,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:19,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:19,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:19,665 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 4290 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:25,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:25,102 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:25,102 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:25,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:25,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:25,103 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:25,112 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:44:25,112 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:44:25,310 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:44:25,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:25,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:32,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 4290 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:32,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:37,538 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 4290 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:37,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:37,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132, 132, 132] total 197 [2018-12-03 15:44:37,559 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:37,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-12-03 15:44:37,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-12-03 15:44:37,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8843, Invalid=30163, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 15:44:37,561 INFO L87 Difference]: Start difference. First operand 267 states and 268 transitions. Second operand 198 states. [2018-12-03 15:44:41,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:41,109 INFO L93 Difference]: Finished difference Result 403 states and 405 transitions. [2018-12-03 15:44:41,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-12-03 15:44:41,109 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 266 [2018-12-03 15:44:41,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:41,110 INFO L225 Difference]: With dead ends: 403 [2018-12-03 15:44:41,110 INFO L226 Difference]: Without dead ends: 269 [2018-12-03 15:44:41,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 335 SyntacticMatches, 131 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25157 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=17488, Invalid=51418, Unknown=0, NotChecked=0, Total=68906 [2018-12-03 15:44:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-12-03 15:44:41,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-12-03 15:44:41,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-03 15:44:41,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 270 transitions. [2018-12-03 15:44:41,162 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 270 transitions. Word has length 266 [2018-12-03 15:44:41,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:41,162 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 270 transitions. [2018-12-03 15:44:41,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-12-03 15:44:41,163 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 270 transitions. [2018-12-03 15:44:41,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-12-03 15:44:41,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:41,164 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 66, 65, 1, 1, 1, 1] [2018-12-03 15:44:41,164 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:41,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:41,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1147793211, now seen corresponding path program 97 times [2018-12-03 15:44:41,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:41,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:41,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:41,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:41,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:43,331 INFO L134 CoverageAnalysis]: Checked inductivity of 8712 backedges. 4422 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:43,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:43,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:43,332 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:43,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:43,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:43,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:43,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:43,341 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:44:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:43,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:43,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8712 backedges. 4422 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:43,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:47,213 INFO L134 CoverageAnalysis]: Checked inductivity of 8712 backedges. 4290 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:47,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:47,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 75 [2018-12-03 15:44:47,233 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:47,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 15:44:47,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 15:44:47,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2575, Invalid=3125, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:44:47,234 INFO L87 Difference]: Start difference. First operand 269 states and 270 transitions. Second operand 73 states. [2018-12-03 15:44:49,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:49,399 INFO L93 Difference]: Finished difference Result 276 states and 278 transitions. [2018-12-03 15:44:49,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-12-03 15:44:49,399 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 268 [2018-12-03 15:44:49,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:49,401 INFO L225 Difference]: With dead ends: 276 [2018-12-03 15:44:49,401 INFO L226 Difference]: Without dead ends: 274 [2018-12-03 15:44:49,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 466 SyntacticMatches, 129 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9450 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=7329, Invalid=12693, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 15:44:49,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-03 15:44:49,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-12-03 15:44:49,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-12-03 15:44:49,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 274 transitions. [2018-12-03 15:44:49,454 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 274 transitions. Word has length 268 [2018-12-03 15:44:49,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:49,455 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 274 transitions. [2018-12-03 15:44:49,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 15:44:49,455 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 274 transitions. [2018-12-03 15:44:49,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-12-03 15:44:49,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:49,456 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 67, 66, 1, 1, 1, 1] [2018-12-03 15:44:49,456 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:49,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:49,456 INFO L82 PathProgramCache]: Analyzing trace with hash 370818095, now seen corresponding path program 98 times [2018-12-03 15:44:49,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:49,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:49,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:49,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:49,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:55,215 INFO L134 CoverageAnalysis]: Checked inductivity of 8978 backedges. 4556 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:55,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:55,215 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:55,215 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:55,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:55,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:55,215 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:55,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:44:55,224 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:44:55,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 68 check-sat command(s) [2018-12-03 15:44:55,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:55,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 8978 backedges. 4556 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:02,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8978 backedges. 4556 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:08,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:08,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135, 135, 135] total 204 [2018-12-03 15:45:08,527 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:08,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 203 states [2018-12-03 15:45:08,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2018-12-03 15:45:08,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9519, Invalid=32301, Unknown=0, NotChecked=0, Total=41820 [2018-12-03 15:45:08,530 INFO L87 Difference]: Start difference. First operand 273 states and 274 transitions. Second operand 203 states. [2018-12-03 15:45:12,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:12,413 INFO L93 Difference]: Finished difference Result 413 states and 415 transitions. [2018-12-03 15:45:12,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-12-03 15:45:12,413 INFO L78 Accepts]: Start accepts. Automaton has 203 states. Word has length 272 [2018-12-03 15:45:12,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:12,414 INFO L225 Difference]: With dead ends: 413 [2018-12-03 15:45:12,414 INFO L226 Difference]: Without dead ends: 275 [2018-12-03 15:45:12,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 342 SyntacticMatches, 132 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26866 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=18561, Invalid=54609, Unknown=0, NotChecked=0, Total=73170 [2018-12-03 15:45:12,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-12-03 15:45:12,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-12-03 15:45:12,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-12-03 15:45:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 276 transitions. [2018-12-03 15:45:12,474 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 276 transitions. Word has length 272 [2018-12-03 15:45:12,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:12,474 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 276 transitions. [2018-12-03 15:45:12,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 203 states. [2018-12-03 15:45:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 276 transitions. [2018-12-03 15:45:12,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-12-03 15:45:12,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:12,476 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1, 1, 1] [2018-12-03 15:45:12,476 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:12,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:12,476 INFO L82 PathProgramCache]: Analyzing trace with hash -2021511381, now seen corresponding path program 99 times [2018-12-03 15:45:12,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:12,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:12,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:12,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:12,477 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:18,315 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 4556 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:18,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:18,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:18,316 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:18,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:18,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:18,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:18,325 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:45:18,326 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:45:18,561 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:45:18,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:18,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:25,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 4556 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:25,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:31,110 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 4556 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:31,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:31,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136, 136, 136] total 203 [2018-12-03 15:45:31,131 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:31,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 204 states [2018-12-03 15:45:31,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2018-12-03 15:45:31,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9383, Invalid=32029, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 15:45:31,134 INFO L87 Difference]: Start difference. First operand 275 states and 276 transitions. Second operand 204 states. [2018-12-03 15:45:35,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:35,241 INFO L93 Difference]: Finished difference Result 415 states and 417 transitions. [2018-12-03 15:45:35,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-12-03 15:45:35,241 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 274 [2018-12-03 15:45:35,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:35,243 INFO L225 Difference]: With dead ends: 415 [2018-12-03 15:45:35,243 INFO L226 Difference]: Without dead ends: 277 [2018-12-03 15:45:35,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 749 GetRequests, 345 SyntacticMatches, 135 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26735 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=18562, Invalid=54608, Unknown=0, NotChecked=0, Total=73170 [2018-12-03 15:45:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-12-03 15:45:35,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-12-03 15:45:35,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-12-03 15:45:35,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2018-12-03 15:45:35,304 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 274 [2018-12-03 15:45:35,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:35,304 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 278 transitions. [2018-12-03 15:45:35,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 204 states. [2018-12-03 15:45:35,304 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 278 transitions. [2018-12-03 15:45:35,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-12-03 15:45:35,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:35,306 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 68, 67, 1, 1, 1, 1] [2018-12-03 15:45:35,306 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:35,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:35,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1052332839, now seen corresponding path program 100 times [2018-12-03 15:45:35,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:35,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:35,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:35,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:35,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:37,431 INFO L134 CoverageAnalysis]: Checked inductivity of 9248 backedges. 4692 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:37,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:37,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:37,431 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:37,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:37,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:37,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:37,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:37,439 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:45:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:37,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:37,835 INFO L134 CoverageAnalysis]: Checked inductivity of 9248 backedges. 4692 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:37,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9248 backedges. 4556 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:41,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:41,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 77 [2018-12-03 15:45:41,457 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:41,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 15:45:41,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 15:45:41,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2720, Invalid=3286, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 15:45:41,458 INFO L87 Difference]: Start difference. First operand 277 states and 278 transitions. Second operand 75 states. [2018-12-03 15:45:43,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:43,958 INFO L93 Difference]: Finished difference Result 284 states and 286 transitions. [2018-12-03 15:45:43,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-12-03 15:45:43,958 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 276 [2018-12-03 15:45:43,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:43,959 INFO L225 Difference]: With dead ends: 284 [2018-12-03 15:45:43,959 INFO L226 Difference]: Without dead ends: 282 [2018-12-03 15:45:43,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 480 SyntacticMatches, 133 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10008 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=7754, Invalid=13416, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 15:45:43,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-03 15:45:44,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2018-12-03 15:45:44,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-12-03 15:45:44,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 282 transitions. [2018-12-03 15:45:44,023 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 282 transitions. Word has length 276 [2018-12-03 15:45:44,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:44,023 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 282 transitions. [2018-12-03 15:45:44,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 15:45:44,023 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 282 transitions. [2018-12-03 15:45:44,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-12-03 15:45:44,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:44,025 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 69, 68, 1, 1, 1, 1] [2018-12-03 15:45:44,025 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:44,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:44,025 INFO L82 PathProgramCache]: Analyzing trace with hash -788674021, now seen corresponding path program 101 times [2018-12-03 15:45:44,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:44,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:44,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:44,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:44,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9522 backedges. 4830 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:50,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:50,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:50,015 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:50,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:50,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:50,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:50,023 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:45:50,024 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:45:50,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-12-03 15:45:50,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:50,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 9522 backedges. 4830 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:57,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:03,965 INFO L134 CoverageAnalysis]: Checked inductivity of 9522 backedges. 4830 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:03,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:03,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139, 139, 139] total 210 [2018-12-03 15:46:03,986 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:03,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 209 states [2018-12-03 15:46:03,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 209 interpolants. [2018-12-03 15:46:03,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10079, Invalid=34231, Unknown=0, NotChecked=0, Total=44310 [2018-12-03 15:46:03,988 INFO L87 Difference]: Start difference. First operand 281 states and 282 transitions. Second operand 209 states. [2018-12-03 15:46:07,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:07,960 INFO L93 Difference]: Finished difference Result 425 states and 427 transitions. [2018-12-03 15:46:07,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-12-03 15:46:07,962 INFO L78 Accepts]: Start accepts. Automaton has 209 states. Word has length 280 [2018-12-03 15:46:07,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:07,963 INFO L225 Difference]: With dead ends: 425 [2018-12-03 15:46:07,963 INFO L226 Difference]: Without dead ends: 283 [2018-12-03 15:46:07,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 765 GetRequests, 352 SyntacticMatches, 136 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28496 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=19667, Invalid=57895, Unknown=0, NotChecked=0, Total=77562 [2018-12-03 15:46:07,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-03 15:46:08,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-12-03 15:46:08,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-03 15:46:08,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 284 transitions. [2018-12-03 15:46:08,022 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 284 transitions. Word has length 280 [2018-12-03 15:46:08,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:08,022 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 284 transitions. [2018-12-03 15:46:08,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 209 states. [2018-12-03 15:46:08,022 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 284 transitions. [2018-12-03 15:46:08,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-12-03 15:46:08,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:08,023 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1, 1, 1] [2018-12-03 15:46:08,024 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:08,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:08,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1884225257, now seen corresponding path program 102 times [2018-12-03 15:46:08,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:08,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:08,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:08,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:08,025 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:14,510 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 4830 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:14,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:14,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:14,510 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:14,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:14,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:14,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:14,519 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:46:14,519 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:46:14,726 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:46:14,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:14,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:21,986 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 4830 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:21,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 4830 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:27,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:27,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140, 140, 140] total 209 [2018-12-03 15:46:27,934 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:27,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 210 states [2018-12-03 15:46:27,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 210 interpolants. [2018-12-03 15:46:27,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9939, Invalid=33951, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 15:46:27,936 INFO L87 Difference]: Start difference. First operand 283 states and 284 transitions. Second operand 210 states. [2018-12-03 15:46:32,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:32,481 INFO L93 Difference]: Finished difference Result 427 states and 429 transitions. [2018-12-03 15:46:32,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-12-03 15:46:32,481 INFO L78 Accepts]: Start accepts. Automaton has 210 states. Word has length 282 [2018-12-03 15:46:32,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:32,482 INFO L225 Difference]: With dead ends: 427 [2018-12-03 15:46:32,482 INFO L226 Difference]: Without dead ends: 285 [2018-12-03 15:46:32,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 771 GetRequests, 355 SyntacticMatches, 139 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28361 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=19668, Invalid=57894, Unknown=0, NotChecked=0, Total=77562 [2018-12-03 15:46:32,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-12-03 15:46:32,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-12-03 15:46:32,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-12-03 15:46:32,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 286 transitions. [2018-12-03 15:46:32,543 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 286 transitions. Word has length 282 [2018-12-03 15:46:32,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:32,543 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 286 transitions. [2018-12-03 15:46:32,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 210 states. [2018-12-03 15:46:32,543 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 286 transitions. [2018-12-03 15:46:32,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-12-03 15:46:32,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:32,545 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 70, 69, 1, 1, 1, 1] [2018-12-03 15:46:32,545 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:32,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:32,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1852991763, now seen corresponding path program 103 times [2018-12-03 15:46:32,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:32,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:32,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:32,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:32,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 9800 backedges. 4970 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:35,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:35,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:35,062 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:35,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:35,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:35,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:35,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:35,072 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:46:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:35,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 9800 backedges. 4970 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:36,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:40,316 INFO L134 CoverageAnalysis]: Checked inductivity of 9800 backedges. 4830 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:40,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:40,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 79 [2018-12-03 15:46:40,336 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:40,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 15:46:40,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 15:46:40,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2869, Invalid=3451, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:46:40,338 INFO L87 Difference]: Start difference. First operand 285 states and 286 transitions. Second operand 77 states. [2018-12-03 15:46:42,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:42,716 INFO L93 Difference]: Finished difference Result 292 states and 294 transitions. [2018-12-03 15:46:42,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-12-03 15:46:42,716 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 284 [2018-12-03 15:46:42,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:42,717 INFO L225 Difference]: With dead ends: 292 [2018-12-03 15:46:42,717 INFO L226 Difference]: Without dead ends: 290 [2018-12-03 15:46:42,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 494 SyntacticMatches, 137 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10582 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=8191, Invalid=14159, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 15:46:42,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-12-03 15:46:42,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-12-03 15:46:42,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-03 15:46:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2018-12-03 15:46:42,779 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 284 [2018-12-03 15:46:42,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:42,779 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2018-12-03 15:46:42,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 15:46:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2018-12-03 15:46:42,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-12-03 15:46:42,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:42,780 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 71, 70, 1, 1, 1, 1] [2018-12-03 15:46:42,781 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:42,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:42,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1323169273, now seen corresponding path program 104 times [2018-12-03 15:46:42,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:42,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:42,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:42,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:42,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat