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/toy/tooDifficultLoopInvariant/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 14:10:33,359 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 14:10:33,361 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 14:10:33,373 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 14:10:33,373 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 14:10:33,374 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 14:10:33,376 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 14:10:33,377 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 14:10:33,379 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 14:10:33,380 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 14:10:33,381 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 14:10:33,381 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 14:10:33,382 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 14:10:33,383 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 14:10:33,385 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 14:10:33,385 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 14:10:33,386 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 14:10:33,388 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 14:10:33,390 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 14:10:33,392 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 14:10:33,393 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 14:10:33,395 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 14:10:33,397 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 14:10:33,398 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 14:10:33,398 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 14:10:33,399 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 14:10:33,400 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 14:10:33,401 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 14:10:33,402 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 14:10:33,403 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 14:10:33,403 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 14:10:33,404 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 14:10:33,405 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 14:10:33,405 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 14:10:33,406 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 14:10:33,407 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 14:10:33,407 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-11 14:10:33,420 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 14:10:33,420 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 14:10:33,421 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 14:10:33,421 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 14:10:33,421 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 14:10:33,422 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 14:10:33,422 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 14:10:33,422 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 14:10:33,422 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 14:10:33,422 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 14:10:33,423 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 14:10:33,423 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 14:10:33,423 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 14:10:33,423 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 14:10:33,424 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 14:10:33,424 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 14:10:33,424 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 14:10:33,424 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 14:10:33,425 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 14:10:33,425 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 14:10:33,425 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 14:10:33,425 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 14:10:33,426 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 14:10:33,426 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 14:10:33,426 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 14:10:33,426 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 14:10:33,427 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 14:10:33,428 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 14:10:33,428 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 14:10:33,428 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 14:10:33,428 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 14:10:33,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:10:33,429 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 14:10:33,429 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 14:10:33,429 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 14:10:33,429 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 14:10:33,429 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 14:10:33,430 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 14:10:33,430 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 14:10:33,430 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 14:10:33,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 14:10:33,498 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 14:10:33,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 14:10:33,506 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 14:10:33,506 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 14:10:33,507 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2019-01-11 14:10:33,507 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2019-01-11 14:10:33,545 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 14:10:33,547 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 14:10:33,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 14:10:33,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 14:10:33,548 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 14:10:33,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:33" (1/1) ... [2019-01-11 14:10:33,577 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:33" (1/1) ... [2019-01-11 14:10:33,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 14:10:33,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 14:10:33,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 14:10:33,589 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 14:10:33,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:33" (1/1) ... [2019-01-11 14:10:33,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:33" (1/1) ... [2019-01-11 14:10:33,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:33" (1/1) ... [2019-01-11 14:10:33,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:33" (1/1) ... [2019-01-11 14:10:33,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:33" (1/1) ... [2019-01-11 14:10:33,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:33" (1/1) ... [2019-01-11 14:10:33,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:33" (1/1) ... [2019-01-11 14:10:33,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 14:10:33,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 14:10:33,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 14:10:33,617 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 14:10:33,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:10:33,686 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-01-11 14:10:33,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 14:10:33,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 14:10:34,034 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 14:10:34,034 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-11 14:10:34,035 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:10:34 BoogieIcfgContainer [2019-01-11 14:10:34,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 14:10:34,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 14:10:34,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 14:10:34,040 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 14:10:34,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:33" (1/2) ... [2019-01-11 14:10:34,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660baa84 and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 02:10:34, skipping insertion in model container [2019-01-11 14:10:34,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:10:34" (2/2) ... [2019-01-11 14:10:34,043 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2019-01-11 14:10:34,053 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 14:10:34,060 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 14:10:34,077 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 14:10:34,107 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 14:10:34,107 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 14:10:34,107 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 14:10:34,108 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 14:10:34,108 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 14:10:34,108 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 14:10:34,108 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 14:10:34,108 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 14:10:34,123 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-01-11 14:10:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:10:34,129 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:34,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:10:34,133 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:34,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:34,140 INFO L82 PathProgramCache]: Analyzing trace with hash 900035954, now seen corresponding path program 1 times [2019-01-11 14:10:34,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:34,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:34,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:34,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:34,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:34,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:10:34,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 14:10:34,378 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:10:34,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:10:34,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:10:34,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 14:10:34,401 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2019-01-11 14:10:34,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:34,567 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-01-11 14:10:34,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:10:34,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-11 14:10:34,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:34,580 INFO L225 Difference]: With dead ends: 26 [2019-01-11 14:10:34,581 INFO L226 Difference]: Without dead ends: 13 [2019-01-11 14:10:34,584 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 [2019-01-11 14:10:34,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-11 14:10:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-01-11 14:10:34,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-11 14:10:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-01-11 14:10:34,619 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 6 [2019-01-11 14:10:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:34,619 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-11 14:10:34,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:10:34,619 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-01-11 14:10:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:10:34,620 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:34,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:10:34,620 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:34,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:34,621 INFO L82 PathProgramCache]: Analyzing trace with hash 429804648, now seen corresponding path program 1 times [2019-01-11 14:10:34,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:34,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:34,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:34,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:34,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:34,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:34,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:10:34,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-11 14:10:34,726 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:10:34,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:10:34,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:10:34,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 14:10:34,729 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2019-01-11 14:10:34,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:34,815 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-01-11 14:10:34,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:10:34,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-11 14:10:34,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:34,817 INFO L225 Difference]: With dead ends: 25 [2019-01-11 14:10:34,817 INFO L226 Difference]: Without dead ends: 23 [2019-01-11 14:10:34,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 14:10:34,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-11 14:10:34,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-01-11 14:10:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-11 14:10:34,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-01-11 14:10:34,825 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2019-01-11 14:10:34,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:34,825 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-11 14:10:34,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:10:34,826 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2019-01-11 14:10:34,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:10:34,826 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:34,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:10:34,827 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:34,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:34,827 INFO L82 PathProgramCache]: Analyzing trace with hash 429806570, now seen corresponding path program 1 times [2019-01-11 14:10:34,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:34,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:34,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:34,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:34,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:34,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:10:34,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:10:34,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 14:10:34,920 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:10:34,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:10:34,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:10:34,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:10:34,922 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2019-01-11 14:10:34,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:34,968 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-01-11 14:10:34,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:10:34,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-11 14:10:34,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:34,969 INFO L225 Difference]: With dead ends: 24 [2019-01-11 14:10:34,969 INFO L226 Difference]: Without dead ends: 13 [2019-01-11 14:10:34,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:10:34,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-11 14:10:34,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-11 14:10:34,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-11 14:10:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-11 14:10:34,973 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2019-01-11 14:10:34,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:34,973 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-11 14:10:34,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:10:34,973 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-11 14:10:34,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:10:34,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:34,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:10:34,974 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:34,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:34,975 INFO L82 PathProgramCache]: Analyzing trace with hash -2090155286, now seen corresponding path program 1 times [2019-01-11 14:10:34,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:34,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:34,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:34,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:34,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:35,327 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-11 14:10:35,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:35,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:35,383 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:35,384 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:10:35,386 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [26], [27] [2019-01-11 14:10:35,425 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:10:35,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:10:35,608 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:10:35,613 INFO L272 AbstractInterpreter]: Visited 9 different actions 29 times. Merged at 8 different actions 18 times. Widened at 1 different actions 1 times. Performed 110 root evaluator evaluations with a maximum evaluation depth of 3. Performed 110 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:10:35,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:35,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:10:35,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:35,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:35,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:35,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:35,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:35,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:35,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:35,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2019-01-11 14:10:35,922 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:35,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 14:10:35,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 14:10:35,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-11 14:10:35,924 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-01-11 14:10:36,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:36,162 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-01-11 14:10:36,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:10:36,163 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-01-11 14:10:36,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:36,164 INFO L225 Difference]: With dead ends: 26 [2019-01-11 14:10:36,164 INFO L226 Difference]: Without dead ends: 19 [2019-01-11 14:10:36,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:10:36,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-11 14:10:36,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-01-11 14:10:36,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-11 14:10:36,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-11 14:10:36,169 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-01-11 14:10:36,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:36,170 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-11 14:10:36,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 14:10:36,170 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-01-11 14:10:36,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-11 14:10:36,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:36,171 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:10:36,172 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:36,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:36,172 INFO L82 PathProgramCache]: Analyzing trace with hash -368470767, now seen corresponding path program 1 times [2019-01-11 14:10:36,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:36,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:36,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:36,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:36,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:36,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:36,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:36,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:36,259 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-01-11 14:10:36,259 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [22], [26], [27], [30], [32] [2019-01-11 14:10:36,262 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:10:36,262 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:10:36,308 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:10:36,309 INFO L272 AbstractInterpreter]: Visited 12 different actions 41 times. Merged at 11 different actions 22 times. Widened at 1 different actions 1 times. Performed 147 root evaluator evaluations with a maximum evaluation depth of 4. Performed 147 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 7 different actions. Largest state had 0 variables. [2019-01-11 14:10:36,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:36,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:10:36,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:36,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:36,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:36,321 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:36,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:36,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:36,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:36,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:36,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2019-01-11 14:10:36,471 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:36,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:10:36,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:10:36,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:10:36,472 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2019-01-11 14:10:36,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:36,857 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-01-11 14:10:36,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:10:36,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-01-11 14:10:36,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:36,859 INFO L225 Difference]: With dead ends: 31 [2019-01-11 14:10:36,859 INFO L226 Difference]: Without dead ends: 19 [2019-01-11 14:10:36,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:10:36,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-11 14:10:36,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-01-11 14:10:36,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 14:10:36,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-01-11 14:10:36,864 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-01-11 14:10:36,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:36,864 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-11 14:10:36,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:10:36,864 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-01-11 14:10:36,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-11 14:10:36,865 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:36,865 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:10:36,865 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:36,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:36,865 INFO L82 PathProgramCache]: Analyzing trace with hash -256855911, now seen corresponding path program 2 times [2019-01-11 14:10:36,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:36,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:36,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:36,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:36,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:37,176 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:37,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:37,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:37,177 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:37,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:37,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:37,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:37,195 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:37,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:37,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:10:37,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:37,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:37,309 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:37,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:37,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:37,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:37,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2019-01-11 14:10:37,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:37,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:10:37,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:10:37,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:10:37,366 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2019-01-11 14:10:37,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:37,675 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-01-11 14:10:37,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:10:37,676 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-01-11 14:10:37,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:37,677 INFO L225 Difference]: With dead ends: 35 [2019-01-11 14:10:37,677 INFO L226 Difference]: Without dead ends: 28 [2019-01-11 14:10:37,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:10:37,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-11 14:10:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-01-11 14:10:37,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-11 14:10:37,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-01-11 14:10:37,683 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-01-11 14:10:37,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:37,684 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-01-11 14:10:37,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:10:37,684 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-01-11 14:10:37,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-11 14:10:37,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:37,685 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-11 14:10:37,685 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:37,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:37,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1110643520, now seen corresponding path program 3 times [2019-01-11 14:10:37,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:37,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:37,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:37,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:37,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:37,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:37,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:37,803 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:37,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:37,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:37,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:37,812 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:37,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:37,818 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:37,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:37,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:37,886 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:37,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:37,907 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:37,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:37,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2019-01-11 14:10:37,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:37,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:10:37,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:10:37,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:10:37,927 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2019-01-11 14:10:38,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:38,031 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-01-11 14:10:38,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:10:38,032 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-11 14:10:38,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:38,032 INFO L225 Difference]: With dead ends: 45 [2019-01-11 14:10:38,032 INFO L226 Difference]: Without dead ends: 26 [2019-01-11 14:10:38,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:10:38,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-11 14:10:38,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-01-11 14:10:38,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-11 14:10:38,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-01-11 14:10:38,039 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2019-01-11 14:10:38,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:38,039 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-01-11 14:10:38,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:10:38,039 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-01-11 14:10:38,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-11 14:10:38,040 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:38,040 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-11 14:10:38,040 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:38,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:38,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1324912968, now seen corresponding path program 4 times [2019-01-11 14:10:38,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:38,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:38,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:38,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:38,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:38,245 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:38,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:38,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:38,246 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:38,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:38,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:38,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:38,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:38,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:38,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:38,484 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:38,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:38,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:38,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2019-01-11 14:10:38,540 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:38,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 14:10:38,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 14:10:38,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:10:38,543 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2019-01-11 14:10:39,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:39,045 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-01-11 14:10:39,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-11 14:10:39,052 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-01-11 14:10:39,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:39,053 INFO L225 Difference]: With dead ends: 49 [2019-01-11 14:10:39,053 INFO L226 Difference]: Without dead ends: 39 [2019-01-11 14:10:39,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:10:39,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-11 14:10:39,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-01-11 14:10:39,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-11 14:10:39,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-01-11 14:10:39,059 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-01-11 14:10:39,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:39,060 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-01-11 14:10:39,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 14:10:39,060 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-01-11 14:10:39,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-11 14:10:39,061 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:39,061 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-11 14:10:39,061 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:39,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:39,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1588570591, now seen corresponding path program 5 times [2019-01-11 14:10:39,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:39,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:39,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:39,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:39,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:39,169 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:39,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:39,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:39,170 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:39,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:39,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:39,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:39,179 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:39,179 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:39,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 14:10:39,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:39,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:39,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:39,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:39,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2019-01-11 14:10:39,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:39,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 14:10:39,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 14:10:39,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:10:39,353 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2019-01-11 14:10:39,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:39,874 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-01-11 14:10:39,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:10:39,875 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-01-11 14:10:39,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:39,876 INFO L225 Difference]: With dead ends: 60 [2019-01-11 14:10:39,876 INFO L226 Difference]: Without dead ends: 33 [2019-01-11 14:10:39,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:10:39,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-11 14:10:39,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-01-11 14:10:39,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-11 14:10:39,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-01-11 14:10:39,883 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-01-11 14:10:39,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:39,884 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-01-11 14:10:39,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 14:10:39,884 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-01-11 14:10:39,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-11 14:10:39,884 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:39,884 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-11 14:10:39,885 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:39,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:39,885 INFO L82 PathProgramCache]: Analyzing trace with hash 366737255, now seen corresponding path program 6 times [2019-01-11 14:10:39,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:39,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:39,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:39,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:39,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:40,124 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:40,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:40,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:40,125 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:40,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:40,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:40,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:40,138 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:40,138 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:40,146 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:40,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:40,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:40,391 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:40,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:40,452 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:40,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:40,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2019-01-11 14:10:40,471 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:40,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-11 14:10:40,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-11 14:10:40,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:10:40,472 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 17 states. [2019-01-11 14:10:40,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:40,996 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-01-11 14:10:40,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-11 14:10:40,999 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-01-11 14:10:41,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:41,000 INFO L225 Difference]: With dead ends: 64 [2019-01-11 14:10:41,000 INFO L226 Difference]: Without dead ends: 50 [2019-01-11 14:10:41,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-01-11 14:10:41,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-11 14:10:41,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-01-11 14:10:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-11 14:10:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-01-11 14:10:41,007 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2019-01-11 14:10:41,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:41,007 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-01-11 14:10:41,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-11 14:10:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-01-11 14:10:41,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-11 14:10:41,009 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:41,009 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-11 14:10:41,009 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:41,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:41,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1079885042, now seen corresponding path program 7 times [2019-01-11 14:10:41,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:41,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:41,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:41,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:41,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:41,186 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:41,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:41,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:41,187 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:41,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:41,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:41,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:41,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:41,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:41,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:41,606 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:41,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:41,651 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:41,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:41,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2019-01-11 14:10:41,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:41,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-11 14:10:41,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-11 14:10:41,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:10:41,673 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 17 states. [2019-01-11 14:10:41,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:41,968 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-01-11 14:10:41,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 14:10:41,968 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-01-11 14:10:41,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:41,969 INFO L225 Difference]: With dead ends: 75 [2019-01-11 14:10:41,969 INFO L226 Difference]: Without dead ends: 40 [2019-01-11 14:10:41,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-11 14:10:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-11 14:10:41,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-01-11 14:10:41,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-11 14:10:41,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-01-11 14:10:41,976 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-01-11 14:10:41,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:41,977 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-01-11 14:10:41,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-11 14:10:41,977 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-01-11 14:10:41,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-11 14:10:41,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:41,978 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-11 14:10:41,978 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:41,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:41,979 INFO L82 PathProgramCache]: Analyzing trace with hash -921359226, now seen corresponding path program 8 times [2019-01-11 14:10:41,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:41,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:41,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:41,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:41,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:42,217 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:42,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:42,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:42,218 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:42,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:42,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:42,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:42,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:42,227 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:42,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-11 14:10:42,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:42,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:42,647 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 32 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:42,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:43,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:43,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2019-01-11 14:10:43,320 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:43,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-11 14:10:43,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-11 14:10:43,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-01-11 14:10:43,323 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 27 states. [2019-01-11 14:10:45,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:45,430 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-01-11 14:10:45,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-11 14:10:45,430 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-01-11 14:10:45,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:45,431 INFO L225 Difference]: With dead ends: 97 [2019-01-11 14:10:45,431 INFO L226 Difference]: Without dead ends: 58 [2019-01-11 14:10:45,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=499, Invalid=3533, Unknown=0, NotChecked=0, Total=4032 [2019-01-11 14:10:45,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-11 14:10:45,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2019-01-11 14:10:45,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-11 14:10:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-01-11 14:10:45,441 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2019-01-11 14:10:45,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:45,441 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-01-11 14:10:45,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-11 14:10:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-01-11 14:10:45,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-11 14:10:45,442 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:45,443 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2019-01-11 14:10:45,443 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:45,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:45,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1868574667, now seen corresponding path program 9 times [2019-01-11 14:10:45,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:45,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:45,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:45,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:45,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:45,913 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:45,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:45,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:45,914 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:45,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:45,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:45,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:45,923 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:45,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:45,932 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:45,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:45,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:46,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:46,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:46,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2019-01-11 14:10:46,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:46,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-11 14:10:46,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-11 14:10:46,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-01-11 14:10:46,181 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 23 states. [2019-01-11 14:10:47,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:47,556 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-01-11 14:10:47,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-11 14:10:47,557 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-01-11 14:10:47,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:47,558 INFO L225 Difference]: With dead ends: 94 [2019-01-11 14:10:47,558 INFO L226 Difference]: Without dead ends: 72 [2019-01-11 14:10:47,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2019-01-11 14:10:47,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-11 14:10:47,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-01-11 14:10:47,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-11 14:10:47,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-01-11 14:10:47,568 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2019-01-11 14:10:47,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:47,568 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-01-11 14:10:47,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-11 14:10:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-01-11 14:10:47,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-11 14:10:47,569 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:47,570 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-11 14:10:47,570 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:47,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:47,570 INFO L82 PathProgramCache]: Analyzing trace with hash 269550812, now seen corresponding path program 10 times [2019-01-11 14:10:47,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:47,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:47,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:47,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:47,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:47,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:47,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:47,720 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:47,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:47,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:47,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:47,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:47,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:47,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:47,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:48,058 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:48,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:48,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2019-01-11 14:10:48,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:48,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-11 14:10:48,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-11 14:10:48,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-01-11 14:10:48,080 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 23 states. [2019-01-11 14:10:48,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:48,354 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-01-11 14:10:48,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-11 14:10:48,354 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-01-11 14:10:48,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:48,355 INFO L225 Difference]: With dead ends: 105 [2019-01-11 14:10:48,356 INFO L226 Difference]: Without dead ends: 54 [2019-01-11 14:10:48,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-01-11 14:10:48,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-11 14:10:48,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-01-11 14:10:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-11 14:10:48,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-01-11 14:10:48,365 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2019-01-11 14:10:48,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:48,366 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-01-11 14:10:48,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-11 14:10:48,366 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-01-11 14:10:48,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-11 14:10:48,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:48,367 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-11 14:10:48,367 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:48,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:48,367 INFO L82 PathProgramCache]: Analyzing trace with hash 2089942100, now seen corresponding path program 11 times [2019-01-11 14:10:48,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:48,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:48,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:48,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:48,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:48,685 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:48,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:48,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:48,685 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:48,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:48,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:48,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:48,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:48,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:48,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-11 14:10:48,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:48,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:48,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:49,055 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:49,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:49,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 25 [2019-01-11 14:10:49,073 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:49,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-11 14:10:49,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-11 14:10:49,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-01-11 14:10:49,075 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2019-01-11 14:10:50,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:50,135 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-01-11 14:10:50,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-11 14:10:50,138 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-01-11 14:10:50,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:50,139 INFO L225 Difference]: With dead ends: 109 [2019-01-11 14:10:50,139 INFO L226 Difference]: Without dead ends: 83 [2019-01-11 14:10:50,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2019-01-11 14:10:50,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-11 14:10:50,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2019-01-11 14:10:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-11 14:10:50,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-01-11 14:10:50,152 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2019-01-11 14:10:50,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:50,152 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-01-11 14:10:50,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-11 14:10:50,152 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-01-11 14:10:50,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-11 14:10:50,153 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:50,153 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-11 14:10:50,154 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:50,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:50,154 INFO L82 PathProgramCache]: Analyzing trace with hash 549587323, now seen corresponding path program 12 times [2019-01-11 14:10:50,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:50,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:50,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:50,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:50,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:50,506 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:50,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:50,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:50,506 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:50,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:50,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:50,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:50,515 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:50,516 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:50,525 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:50,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:50,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:50,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:50,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:50,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2019-01-11 14:10:50,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:50,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-11 14:10:50,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-11 14:10:50,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-01-11 14:10:50,958 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2019-01-11 14:10:51,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:51,312 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-01-11 14:10:51,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-11 14:10:51,313 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-01-11 14:10:51,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:51,314 INFO L225 Difference]: With dead ends: 120 [2019-01-11 14:10:51,314 INFO L226 Difference]: Without dead ends: 61 [2019-01-11 14:10:51,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2019-01-11 14:10:51,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-11 14:10:51,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-01-11 14:10:51,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-11 14:10:51,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-01-11 14:10:51,325 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2019-01-11 14:10:51,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:51,325 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-01-11 14:10:51,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-11 14:10:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-01-11 14:10:51,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-11 14:10:51,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:51,327 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-11 14:10:51,327 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:51,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:51,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1743111421, now seen corresponding path program 13 times [2019-01-11 14:10:51,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:51,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:51,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:51,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:51,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:51,872 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:51,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:51,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:51,873 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:51,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:51,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:51,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:51,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:51,882 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:51,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:52,169 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:52,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:52,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:52,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 28 [2019-01-11 14:10:52,258 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:52,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-11 14:10:52,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-11 14:10:52,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-01-11 14:10:52,259 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 29 states. [2019-01-11 14:10:53,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:53,690 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-01-11 14:10:53,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-11 14:10:53,691 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-01-11 14:10:53,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:53,691 INFO L225 Difference]: With dead ends: 124 [2019-01-11 14:10:53,691 INFO L226 Difference]: Without dead ends: 94 [2019-01-11 14:10:53,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2019-01-11 14:10:53,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-11 14:10:53,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-01-11 14:10:53,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-11 14:10:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-01-11 14:10:53,706 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2019-01-11 14:10:53,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:53,706 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-01-11 14:10:53,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-11 14:10:53,707 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-01-11 14:10:53,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-11 14:10:53,708 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:53,712 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-11 14:10:53,712 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:53,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:53,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1415751510, now seen corresponding path program 14 times [2019-01-11 14:10:53,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:53,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:53,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:53,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:53,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:53,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:53,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:53,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:53,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:53,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:53,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:53,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:53,960 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:53,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-11 14:10:53,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:53,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:54,235 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:54,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:54,387 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:54,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:54,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2019-01-11 14:10:54,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:54,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-11 14:10:54,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-11 14:10:54,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-01-11 14:10:54,406 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2019-01-11 14:10:54,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:54,817 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-01-11 14:10:54,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-11 14:10:54,817 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-01-11 14:10:54,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:54,818 INFO L225 Difference]: With dead ends: 135 [2019-01-11 14:10:54,818 INFO L226 Difference]: Without dead ends: 68 [2019-01-11 14:10:54,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 14:10:54,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-11 14:10:54,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-01-11 14:10:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-11 14:10:54,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-01-11 14:10:54,829 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2019-01-11 14:10:54,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:54,829 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-01-11 14:10:54,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-11 14:10:54,829 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-01-11 14:10:54,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-11 14:10:54,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:54,830 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-11 14:10:54,831 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:54,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:54,831 INFO L82 PathProgramCache]: Analyzing trace with hash 175889954, now seen corresponding path program 15 times [2019-01-11 14:10:54,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:54,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:54,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:54,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:54,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:55,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:55,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:55,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:55,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:55,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:55,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:55,291 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:55,292 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:55,302 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:55,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:55,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:55,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:55,770 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:55,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:55,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 31 [2019-01-11 14:10:55,788 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:55,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-11 14:10:55,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-11 14:10:55,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2019-01-11 14:10:55,789 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2019-01-11 14:10:57,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:57,593 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2019-01-11 14:10:57,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-11 14:10:57,593 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 65 [2019-01-11 14:10:57,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:57,594 INFO L225 Difference]: With dead ends: 139 [2019-01-11 14:10:57,594 INFO L226 Difference]: Without dead ends: 105 [2019-01-11 14:10:57,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 14:10:57,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-11 14:10:57,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2019-01-11 14:10:57,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-11 14:10:57,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-01-11 14:10:57,606 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 65 [2019-01-11 14:10:57,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:57,606 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-01-11 14:10:57,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-11 14:10:57,606 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-01-11 14:10:57,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-11 14:10:57,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:57,607 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-11 14:10:57,607 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:57,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:57,608 INFO L82 PathProgramCache]: Analyzing trace with hash 2774089, now seen corresponding path program 16 times [2019-01-11 14:10:57,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:57,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:57,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:57,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:57,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:58,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:58,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:58,017 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:58,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:58,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:58,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:58,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:58,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:58,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:58,448 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:58,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:58,662 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:58,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:58,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2019-01-11 14:10:58,681 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:58,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-11 14:10:58,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-11 14:10:58,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2019-01-11 14:10:58,682 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 32 states. [2019-01-11 14:10:59,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:59,074 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-01-11 14:10:59,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-11 14:10:59,074 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2019-01-11 14:10:59,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:59,075 INFO L225 Difference]: With dead ends: 150 [2019-01-11 14:10:59,075 INFO L226 Difference]: Without dead ends: 75 [2019-01-11 14:10:59,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 108 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=436, Invalid=1286, Unknown=0, NotChecked=0, Total=1722 [2019-01-11 14:10:59,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-11 14:10:59,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-01-11 14:10:59,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-11 14:10:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-01-11 14:10:59,086 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2019-01-11 14:10:59,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:59,086 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-01-11 14:10:59,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-11 14:10:59,087 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-01-11 14:10:59,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-11 14:10:59,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:59,087 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-11 14:10:59,088 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:59,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:59,088 INFO L82 PathProgramCache]: Analyzing trace with hash 2036938705, now seen corresponding path program 17 times [2019-01-11 14:10:59,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:59,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:59,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:59,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:59,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:59,595 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 9 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:59,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:59,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:59,595 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:59,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:59,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:59,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:59,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:59,604 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:59,623 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-11 14:10:59,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:59,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 162 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:00,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:01,454 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 153 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:01,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:01,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 58 [2019-01-11 14:11:01,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:01,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-11 14:11:01,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-11 14:11:01,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3001, Unknown=0, NotChecked=0, Total=3422 [2019-01-11 14:11:01,474 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2019-01-11 14:11:04,021 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-11 14:11:06,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:06,031 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2019-01-11 14:11:06,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-11 14:11:06,031 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2019-01-11 14:11:06,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:06,032 INFO L225 Difference]: With dead ends: 192 [2019-01-11 14:11:06,032 INFO L226 Difference]: Without dead ends: 113 [2019-01-11 14:11:06,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3015 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1319, Invalid=12723, Unknown=0, NotChecked=0, Total=14042 [2019-01-11 14:11:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-11 14:11:06,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2019-01-11 14:11:06,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-11 14:11:06,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-01-11 14:11:06,045 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2019-01-11 14:11:06,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:06,046 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-01-11 14:11:06,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-11 14:11:06,046 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-01-11 14:11:06,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-11 14:11:06,046 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:06,046 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2019-01-11 14:11:06,047 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:06,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:06,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1070649840, now seen corresponding path program 18 times [2019-01-11 14:11:06,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:06,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:06,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:06,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:06,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:06,970 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:06,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:06,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:06,971 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:06,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:06,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:06,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:06,984 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:11:06,984 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:11:06,998 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:11:06,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:07,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:07,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:07,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:07,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 37 [2019-01-11 14:11:07,607 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:07,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-11 14:11:07,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-11 14:11:07,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 14:11:07,608 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 38 states. [2019-01-11 14:11:09,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:09,726 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2019-01-11 14:11:09,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-11 14:11:09,729 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2019-01-11 14:11:09,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:09,730 INFO L225 Difference]: With dead ends: 169 [2019-01-11 14:11:09,730 INFO L226 Difference]: Without dead ends: 127 [2019-01-11 14:11:09,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2019-01-11 14:11:09,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-11 14:11:09,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2019-01-11 14:11:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-11 14:11:09,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-01-11 14:11:09,744 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2019-01-11 14:11:09,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:09,744 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-01-11 14:11:09,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-11 14:11:09,745 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-01-11 14:11:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-11 14:11:09,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:09,746 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-11 14:11:09,746 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:09,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:09,746 INFO L82 PathProgramCache]: Analyzing trace with hash -685461225, now seen corresponding path program 19 times [2019-01-11 14:11:09,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:09,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:09,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:09,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:09,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:10,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:10,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:10,014 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:10,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:10,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:10,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:10,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:10,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:11:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:10,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:10,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:10,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:10,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2019-01-11 14:11:10,541 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:10,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-11 14:11:10,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-11 14:11:10,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 14:11:10,543 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2019-01-11 14:11:11,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:11,246 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2019-01-11 14:11:11,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-11 14:11:11,247 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2019-01-11 14:11:11,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:11,247 INFO L225 Difference]: With dead ends: 180 [2019-01-11 14:11:11,247 INFO L226 Difference]: Without dead ends: 89 [2019-01-11 14:11:11,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 130 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=607, Invalid=1843, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 14:11:11,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-11 14:11:11,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-01-11 14:11:11,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-11 14:11:11,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-01-11 14:11:11,260 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2019-01-11 14:11:11,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:11,260 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-01-11 14:11:11,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-11 14:11:11,261 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-01-11 14:11:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-11 14:11:11,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:11,262 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-11 14:11:11,262 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:11,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:11,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1750415713, now seen corresponding path program 20 times [2019-01-11 14:11:11,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:11,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:11,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:11,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:11,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 11 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:11,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:11,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:11,785 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:11,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:11,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:11,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:11,794 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:11:11,794 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:11:11,815 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-11 14:11:11,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:11,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:12,914 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 242 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:12,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:13,870 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 231 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:13,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:13,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 68 [2019-01-11 14:11:13,888 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:13,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-11 14:11:13,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-11 14:11:13,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=4132, Unknown=0, NotChecked=0, Total=4692 [2019-01-11 14:11:13,891 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 55 states. [2019-01-11 14:11:19,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:19,998 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2019-01-11 14:11:19,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-11 14:11:19,999 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 86 [2019-01-11 14:11:19,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:20,000 INFO L225 Difference]: With dead ends: 230 [2019-01-11 14:11:20,000 INFO L226 Difference]: Without dead ends: 135 [2019-01-11 14:11:20,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1745, Invalid=17995, Unknown=0, NotChecked=0, Total=19740 [2019-01-11 14:11:20,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-11 14:11:20,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2019-01-11 14:11:20,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-11 14:11:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-01-11 14:11:20,017 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 86 [2019-01-11 14:11:20,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:20,017 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-01-11 14:11:20,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-11 14:11:20,017 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-01-11 14:11:20,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-11 14:11:20,018 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:20,018 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2019-01-11 14:11:20,018 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:20,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:20,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2005850046, now seen corresponding path program 21 times [2019-01-11 14:11:20,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:20,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:20,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:20,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:20,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:20,626 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:20,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:20,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:20,627 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:20,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:20,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:20,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:20,635 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:11:20,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:11:20,649 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:11:20,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:20,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:21,235 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:21,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:21,388 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:21,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:21,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 43 [2019-01-11 14:11:21,407 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:21,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-11 14:11:21,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-11 14:11:21,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1778, Unknown=0, NotChecked=0, Total=1892 [2019-01-11 14:11:21,408 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 44 states. [2019-01-11 14:11:24,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:24,564 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2019-01-11 14:11:24,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-11 14:11:24,564 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2019-01-11 14:11:24,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:24,565 INFO L225 Difference]: With dead ends: 199 [2019-01-11 14:11:24,566 INFO L226 Difference]: Without dead ends: 149 [2019-01-11 14:11:24,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2019-01-11 14:11:24,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-11 14:11:24,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2019-01-11 14:11:24,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-11 14:11:24,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-01-11 14:11:24,580 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2019-01-11 14:11:24,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:24,580 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-01-11 14:11:24,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-11 14:11:24,580 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-01-11 14:11:24,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-11 14:11:24,581 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:24,581 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-11 14:11:24,581 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:24,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:24,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1370431461, now seen corresponding path program 22 times [2019-01-11 14:11:24,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:24,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:24,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:24,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:24,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:24,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:24,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:24,927 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:24,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:24,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:24,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:24,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:24,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:11:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:24,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:25,321 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:25,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:26,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:26,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2019-01-11 14:11:26,677 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:26,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-11 14:11:26,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-11 14:11:26,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2019-01-11 14:11:26,678 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 44 states. [2019-01-11 14:11:27,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:27,314 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2019-01-11 14:11:27,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-11 14:11:27,315 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2019-01-11 14:11:27,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:27,315 INFO L225 Difference]: With dead ends: 210 [2019-01-11 14:11:27,316 INFO L226 Difference]: Without dead ends: 103 [2019-01-11 14:11:27,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 152 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=806, Invalid=2500, Unknown=0, NotChecked=0, Total=3306 [2019-01-11 14:11:27,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-11 14:11:27,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-01-11 14:11:27,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-11 14:11:27,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-01-11 14:11:27,332 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2019-01-11 14:11:27,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:27,332 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-01-11 14:11:27,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-11 14:11:27,332 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-01-11 14:11:27,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-11 14:11:27,333 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:27,333 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-11 14:11:27,333 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:27,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:27,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1811736429, now seen corresponding path program 23 times [2019-01-11 14:11:27,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:27,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:27,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:27,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:27,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:28,172 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:28,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:28,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:28,173 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:28,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:28,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:28,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:28,183 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:11:28,183 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:11:28,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-11 14:11:28,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:28,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:28,886 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:28,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:29,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:29,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 46 [2019-01-11 14:11:29,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:29,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-11 14:11:29,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-11 14:11:29,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2019-01-11 14:11:29,005 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 47 states. [2019-01-11 14:11:32,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:32,559 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2019-01-11 14:11:32,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-11 14:11:32,559 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 100 [2019-01-11 14:11:32,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:32,561 INFO L225 Difference]: With dead ends: 214 [2019-01-11 14:11:32,561 INFO L226 Difference]: Without dead ends: 160 [2019-01-11 14:11:32,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2019-01-11 14:11:32,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-11 14:11:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2019-01-11 14:11:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-11 14:11:32,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2019-01-11 14:11:32,577 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2019-01-11 14:11:32,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:32,577 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2019-01-11 14:11:32,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-11 14:11:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2019-01-11 14:11:32,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-11 14:11:32,578 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:32,578 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-11 14:11:32,578 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:32,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:32,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1008713748, now seen corresponding path program 24 times [2019-01-11 14:11:32,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:32,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:32,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:32,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:32,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:32,999 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:32,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:32,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:33,000 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:33,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:33,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:33,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:33,008 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:11:33,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:11:33,023 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:11:33,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:33,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:33,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:33,702 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:33,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:33,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2019-01-11 14:11:33,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:33,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-11 14:11:33,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-11 14:11:33,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2019-01-11 14:11:33,721 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2019-01-11 14:11:34,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:34,315 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2019-01-11 14:11:34,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-11 14:11:34,316 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2019-01-11 14:11:34,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:34,317 INFO L225 Difference]: With dead ends: 225 [2019-01-11 14:11:34,317 INFO L226 Difference]: Without dead ends: 110 [2019-01-11 14:11:34,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 163 SyntacticMatches, 29 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2019-01-11 14:11:34,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-11 14:11:34,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-01-11 14:11:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-11 14:11:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-01-11 14:11:34,334 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 104 [2019-01-11 14:11:34,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:34,334 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-01-11 14:11:34,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-11 14:11:34,334 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-01-11 14:11:34,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-11 14:11:34,335 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:34,335 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-11 14:11:34,335 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:34,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:34,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1699483764, now seen corresponding path program 25 times [2019-01-11 14:11:34,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:34,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:34,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:34,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:34,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:35,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:35,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:35,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:35,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:35,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:35,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:35,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:35,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:11:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:35,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:35,758 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:35,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:35,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:35,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 49 [2019-01-11 14:11:35,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:35,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-11 14:11:35,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-11 14:11:35,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 14:11:35,858 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2019-01-11 14:11:40,679 WARN L181 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-11 14:11:40,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:40,985 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2019-01-11 14:11:40,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-11 14:11:40,986 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2019-01-11 14:11:40,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:40,987 INFO L225 Difference]: With dead ends: 229 [2019-01-11 14:11:40,987 INFO L226 Difference]: Without dead ends: 171 [2019-01-11 14:11:40,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=491, Invalid=5829, Unknown=0, NotChecked=0, Total=6320 [2019-01-11 14:11:40,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-11 14:11:41,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2019-01-11 14:11:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-11 14:11:41,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-01-11 14:11:41,010 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-01-11 14:11:41,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:41,010 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-01-11 14:11:41,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-11 14:11:41,010 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-01-11 14:11:41,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-11 14:11:41,011 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:41,011 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-11 14:11:41,011 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:41,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:41,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1446534989, now seen corresponding path program 26 times [2019-01-11 14:11:41,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:41,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:41,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:41,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:41,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:41,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:41,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:41,416 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:41,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:41,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:41,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:41,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:11:41,434 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:11:41,462 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-11 14:11:41,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:41,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:42,134 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:42,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:42,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:42,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2019-01-11 14:11:42,455 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:42,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-11 14:11:42,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-11 14:11:42,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 14:11:42,457 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 50 states. [2019-01-11 14:11:42,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:42,990 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2019-01-11 14:11:42,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-11 14:11:42,990 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 111 [2019-01-11 14:11:42,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:42,991 INFO L225 Difference]: With dead ends: 240 [2019-01-11 14:11:42,992 INFO L226 Difference]: Without dead ends: 117 [2019-01-11 14:11:42,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 174 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2019-01-11 14:11:42,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-11 14:11:43,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-01-11 14:11:43,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-11 14:11:43,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-01-11 14:11:43,010 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 111 [2019-01-11 14:11:43,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:43,010 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-01-11 14:11:43,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-11 14:11:43,010 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-01-11 14:11:43,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-11 14:11:43,011 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:43,011 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-11 14:11:43,011 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:43,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:43,011 INFO L82 PathProgramCache]: Analyzing trace with hash -2055366085, now seen corresponding path program 27 times [2019-01-11 14:11:43,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:43,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:43,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:43,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:43,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:43,992 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:43,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:43,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:43,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:43,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:43,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:43,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:44,002 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:11:44,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:11:44,031 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:11:44,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:44,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:44,853 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:44,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:44,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:44,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 52 [2019-01-11 14:11:44,953 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:44,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-11 14:11:44,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-11 14:11:44,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2618, Unknown=0, NotChecked=0, Total=2756 [2019-01-11 14:11:44,954 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 53 states. [2019-01-11 14:11:50,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:50,061 INFO L93 Difference]: Finished difference Result 244 states and 249 transitions. [2019-01-11 14:11:50,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-11 14:11:50,064 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 114 [2019-01-11 14:11:50,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:50,065 INFO L225 Difference]: With dead ends: 244 [2019-01-11 14:11:50,065 INFO L226 Difference]: Without dead ends: 182 [2019-01-11 14:11:50,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=539, Invalid=6601, Unknown=0, NotChecked=0, Total=7140 [2019-01-11 14:11:50,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-11 14:11:50,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2019-01-11 14:11:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-11 14:11:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-01-11 14:11:50,088 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2019-01-11 14:11:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:50,088 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-01-11 14:11:50,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-11 14:11:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-01-11 14:11:50,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-11 14:11:50,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:50,089 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-11 14:11:50,089 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:50,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:50,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1833851874, now seen corresponding path program 28 times [2019-01-11 14:11:50,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:50,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:50,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:50,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:50,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:50,659 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:50,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:50,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:50,659 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:50,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:50,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:50,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:50,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:50,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:11:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:50,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:51,193 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:51,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:51,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:51,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2019-01-11 14:11:51,560 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:51,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-11 14:11:51,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-11 14:11:51,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2019-01-11 14:11:51,561 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 53 states. [2019-01-11 14:11:52,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:52,713 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2019-01-11 14:11:52,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-11 14:11:52,714 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 118 [2019-01-11 14:11:52,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:52,715 INFO L225 Difference]: With dead ends: 255 [2019-01-11 14:11:52,715 INFO L226 Difference]: Without dead ends: 124 [2019-01-11 14:11:52,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 185 SyntacticMatches, 33 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2019-01-11 14:11:52,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-11 14:11:52,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-01-11 14:11:52,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-11 14:11:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-01-11 14:11:52,735 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 118 [2019-01-11 14:11:52,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:52,735 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-01-11 14:11:52,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-11 14:11:52,735 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-01-11 14:11:52,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-11 14:11:52,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:52,736 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-11 14:11:52,736 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:52,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:52,736 INFO L82 PathProgramCache]: Analyzing trace with hash 540940634, now seen corresponding path program 29 times [2019-01-11 14:11:52,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:52,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:52,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:52,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:52,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 16 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:53,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:53,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:53,634 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:53,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:53,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:53,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:53,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:11:53,644 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:11:53,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-11 14:11:53,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:53,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 512 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:55,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:57,701 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 496 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:57,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:57,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 93 [2019-01-11 14:11:57,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:57,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-11 14:11:57,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-11 14:11:57,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=7747, Unknown=0, NotChecked=0, Total=8742 [2019-01-11 14:11:57,722 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 75 states. [2019-01-11 14:12:08,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:08,002 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2019-01-11 14:12:08,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-01-11 14:12:08,003 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 121 [2019-01-11 14:12:08,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:08,004 INFO L225 Difference]: With dead ends: 325 [2019-01-11 14:12:08,005 INFO L226 Difference]: Without dead ends: 190 [2019-01-11 14:12:08,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 167 SyntacticMatches, 18 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8265 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=3055, Invalid=35165, Unknown=0, NotChecked=0, Total=38220 [2019-01-11 14:12:08,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-11 14:12:08,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2019-01-11 14:12:08,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-11 14:12:08,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-01-11 14:12:08,025 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 121 [2019-01-11 14:12:08,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:08,025 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-01-11 14:12:08,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-11 14:12:08,025 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-01-11 14:12:08,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-11 14:12:08,025 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:08,026 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2019-01-11 14:12:08,026 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:08,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:08,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1991581943, now seen corresponding path program 30 times [2019-01-11 14:12:08,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:08,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:08,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:12:08,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:08,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:12:09,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:09,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:09,093 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:09,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:09,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:09,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:12:09,103 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:12:09,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:12:09,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:12:09,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:12:09,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:12:09,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:12:10,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:10,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 58 [2019-01-11 14:12:10,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:10,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-11 14:12:10,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-11 14:12:10,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2019-01-11 14:12:10,134 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2019-01-11 14:12:15,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:15,923 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2019-01-11 14:12:15,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-11 14:12:15,924 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2019-01-11 14:12:15,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:15,926 INFO L225 Difference]: With dead ends: 274 [2019-01-11 14:12:15,926 INFO L226 Difference]: Without dead ends: 204 [2019-01-11 14:12:15,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=641, Invalid=8289, Unknown=0, NotChecked=0, Total=8930 [2019-01-11 14:12:15,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-11 14:12:15,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2019-01-11 14:12:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-11 14:12:15,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2019-01-11 14:12:15,946 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2019-01-11 14:12:15,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:15,946 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2019-01-11 14:12:15,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-11 14:12:15,946 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2019-01-11 14:12:15,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-11 14:12:15,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:15,947 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-01-11 14:12:15,947 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:15,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:15,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1942976080, now seen corresponding path program 31 times [2019-01-11 14:12:15,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:15,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:15,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:12:15,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:15,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:16,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:12:16,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:16,577 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:16,577 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:16,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:16,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:16,577 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:12:16,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:12:16,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:12:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:16,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:17,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:12:17,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:17,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:12:17,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:17,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2019-01-11 14:12:17,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:17,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-11 14:12:17,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-11 14:12:17,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2019-01-11 14:12:17,979 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 59 states. [2019-01-11 14:12:18,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:18,841 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2019-01-11 14:12:18,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-11 14:12:18,841 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 132 [2019-01-11 14:12:18,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:18,842 INFO L225 Difference]: With dead ends: 285 [2019-01-11 14:12:18,843 INFO L226 Difference]: Without dead ends: 138 [2019-01-11 14:12:18,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 207 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2019-01-11 14:12:18,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-11 14:12:18,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-01-11 14:12:18,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-11 14:12:18,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-01-11 14:12:18,867 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2019-01-11 14:12:18,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:18,867 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-01-11 14:12:18,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-11 14:12:18,867 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-01-11 14:12:18,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-11 14:12:18,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:18,868 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2019-01-11 14:12:18,868 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:18,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:18,869 INFO L82 PathProgramCache]: Analyzing trace with hash 220943656, now seen corresponding path program 32 times [2019-01-11 14:12:18,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:18,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:18,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:12:18,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:18,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 18 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:12:19,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:19,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:19,991 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:19,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:19,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:19,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:12:20,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:12:20,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:12:20,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-11 14:12:20,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:12:20,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 648 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:12:22,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 630 proven. 568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:12:24,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:24,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 103 [2019-01-11 14:12:24,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:24,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-11 14:12:24,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-11 14:12:24,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1204, Invalid=9508, Unknown=0, NotChecked=0, Total=10712 [2019-01-11 14:12:24,786 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 83 states. [2019-01-11 14:12:35,567 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-11 14:12:35,856 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-11 14:12:38,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:38,506 INFO L93 Difference]: Finished difference Result 363 states and 369 transitions. [2019-01-11 14:12:38,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-01-11 14:12:38,506 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 135 [2019-01-11 14:12:38,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:38,507 INFO L225 Difference]: With dead ends: 363 [2019-01-11 14:12:38,507 INFO L226 Difference]: Without dead ends: 212 [2019-01-11 14:12:38,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10242 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=3677, Invalid=43629, Unknown=0, NotChecked=0, Total=47306 [2019-01-11 14:12:38,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-11 14:12:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2019-01-11 14:12:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-11 14:12:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2019-01-11 14:12:38,534 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2019-01-11 14:12:38,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:38,534 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2019-01-11 14:12:38,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-11 14:12:38,534 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2019-01-11 14:12:38,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-11 14:12:38,535 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:38,535 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2019-01-11 14:12:38,535 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:38,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:38,535 INFO L82 PathProgramCache]: Analyzing trace with hash 847427031, now seen corresponding path program 33 times [2019-01-11 14:12:38,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:38,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:38,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:12:38,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:38,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:39,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:12:39,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:39,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:39,899 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:39,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:39,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:39,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:12:39,908 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:12:39,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:12:39,940 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:12:39,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:12:39,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:41,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:12:41,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:12:41,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:41,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 64 [2019-01-11 14:12:41,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:41,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-11 14:12:41,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-11 14:12:41,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3990, Unknown=0, NotChecked=0, Total=4160 [2019-01-11 14:12:41,179 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 65 states. [2019-01-11 14:12:45,539 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-11 14:12:45,838 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-11 14:12:46,099 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-11 14:12:47,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:47,944 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2019-01-11 14:12:47,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-11 14:12:47,944 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 142 [2019-01-11 14:12:47,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:47,945 INFO L225 Difference]: With dead ends: 304 [2019-01-11 14:12:47,945 INFO L226 Difference]: Without dead ends: 226 [2019-01-11 14:12:47,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=751, Invalid=10169, Unknown=0, NotChecked=0, Total=10920 [2019-01-11 14:12:47,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-01-11 14:12:47,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147. [2019-01-11 14:12:47,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-11 14:12:47,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2019-01-11 14:12:47,968 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 142 [2019-01-11 14:12:47,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:47,968 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2019-01-11 14:12:47,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-11 14:12:47,968 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2019-01-11 14:12:47,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-11 14:12:47,969 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:47,969 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-01-11 14:12:47,970 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:47,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:47,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1796978306, now seen corresponding path program 34 times [2019-01-11 14:12:47,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:47,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:47,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:12:47,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:47,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:48,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:12:48,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:48,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:48,962 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:48,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:48,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:48,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:12:48,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:12:48,973 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:12:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:49,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:49,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:12:49,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:50,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:12:50,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:50,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2019-01-11 14:12:50,349 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:50,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-11 14:12:50,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-11 14:12:50,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2019-01-11 14:12:50,351 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 65 states. [2019-01-11 14:12:51,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:51,713 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2019-01-11 14:12:51,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-11 14:12:51,713 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 146 [2019-01-11 14:12:51,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:51,715 INFO L225 Difference]: With dead ends: 315 [2019-01-11 14:12:51,715 INFO L226 Difference]: Without dead ends: 152 [2019-01-11 14:12:51,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 229 SyntacticMatches, 41 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1723, Invalid=5587, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 14:12:51,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-11 14:12:51,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-01-11 14:12:51,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-11 14:12:51,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-01-11 14:12:51,750 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2019-01-11 14:12:51,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:51,750 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-01-11 14:12:51,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-11 14:12:51,751 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-01-11 14:12:51,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-01-11 14:12:51,751 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:51,752 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2019-01-11 14:12:51,752 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:51,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:51,752 INFO L82 PathProgramCache]: Analyzing trace with hash -193355018, now seen corresponding path program 35 times [2019-01-11 14:12:51,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:51,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:51,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:12:51,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:51,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:54,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 20 proven. 1451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:12:54,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:54,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:54,330 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:54,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:54,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:54,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:12:54,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:12:54,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:12:54,376 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-11 14:12:54,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:12:54,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:57,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 800 proven. 671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:12:57,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:13:00,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 780 proven. 691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:13:00,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:13:00,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 46] total 113 [2019-01-11 14:13:00,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:13:00,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-11 14:13:00,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-11 14:13:00,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=11449, Unknown=0, NotChecked=0, Total=12882 [2019-01-11 14:13:00,113 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 91 states. [2019-01-11 14:13:11,883 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-11 14:13:12,190 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-11 14:13:12,504 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-11 14:13:12,778 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 14:13:14,023 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-01-11 14:13:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:13:15,542 INFO L93 Difference]: Finished difference Result 401 states and 407 transitions. [2019-01-11 14:13:15,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-01-11 14:13:15,542 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 149 [2019-01-11 14:13:15,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:13:15,544 INFO L225 Difference]: With dead ends: 401 [2019-01-11 14:13:15,544 INFO L226 Difference]: Without dead ends: 234 [2019-01-11 14:13:15,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 207 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12431 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=4355, Invalid=53005, Unknown=0, NotChecked=0, Total=57360 [2019-01-11 14:13:15,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-01-11 14:13:15,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2019-01-11 14:13:15,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-11 14:13:15,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2019-01-11 14:13:15,571 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 149 [2019-01-11 14:13:15,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:13:15,572 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2019-01-11 14:13:15,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-11 14:13:15,572 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2019-01-11 14:13:15,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-11 14:13:15,573 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:13:15,573 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2019-01-11 14:13:15,573 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:13:15,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:13:15,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1380130469, now seen corresponding path program 36 times [2019-01-11 14:13:15,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:13:15,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:15,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:13:15,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:15,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:13:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:17,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:13:17,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:17,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:13:17,292 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:13:17,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:13:17,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:17,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:13:17,300 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:13:17,300 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:13:17,325 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:13:17,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:13:17,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:13:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:13:19,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:13:20,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:13:20,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:13:20,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 70 [2019-01-11 14:13:20,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:13:20,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-11 14:13:20,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-11 14:13:20,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4784, Unknown=0, NotChecked=0, Total=4970 [2019-01-11 14:13:20,024 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 71 states. [2019-01-11 14:13:25,800 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-11 14:13:26,104 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-11 14:13:26,404 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-11 14:13:26,607 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 14:13:26,805 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 14:13:28,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:13:28,772 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2019-01-11 14:13:28,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-11 14:13:28,772 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 156 [2019-01-11 14:13:28,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:13:28,773 INFO L225 Difference]: With dead ends: 334 [2019-01-11 14:13:28,773 INFO L226 Difference]: Without dead ends: 248 [2019-01-11 14:13:28,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2019-01-11 14:13:28,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-11 14:13:28,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 161. [2019-01-11 14:13:28,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-11 14:13:28,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-01-11 14:13:28,803 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 156 [2019-01-11 14:13:28,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:13:28,803 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-01-11 14:13:28,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-11 14:13:28,803 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-01-11 14:13:28,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-11 14:13:28,804 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:13:28,804 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-01-11 14:13:28,805 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:13:28,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:13:28,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1719166132, now seen corresponding path program 37 times [2019-01-11 14:13:28,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:13:28,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:28,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:13:28,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:28,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:13:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:13:29,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:29,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:13:29,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:13:29,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:13:29,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:29,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:13:29,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:13:29,823 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:13:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:29,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:13:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:13:30,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:13:31,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:13:31,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:13:31,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 70 [2019-01-11 14:13:31,421 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:13:31,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-11 14:13:31,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-11 14:13:31,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2019-01-11 14:13:31,422 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 71 states. [2019-01-11 14:13:33,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:13:33,019 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2019-01-11 14:13:33,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-11 14:13:33,021 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2019-01-11 14:13:33,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:13:33,022 INFO L225 Difference]: With dead ends: 345 [2019-01-11 14:13:33,022 INFO L226 Difference]: Without dead ends: 166 [2019-01-11 14:13:33,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 251 SyntacticMatches, 45 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2048, Invalid=6694, Unknown=0, NotChecked=0, Total=8742 [2019-01-11 14:13:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-11 14:13:33,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-01-11 14:13:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-01-11 14:13:33,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2019-01-11 14:13:33,049 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 160 [2019-01-11 14:13:33,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:13:33,049 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2019-01-11 14:13:33,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-11 14:13:33,049 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2019-01-11 14:13:33,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-11 14:13:33,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:13:33,050 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2019-01-11 14:13:33,050 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:13:33,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:13:33,051 INFO L82 PathProgramCache]: Analyzing trace with hash -148438332, now seen corresponding path program 38 times [2019-01-11 14:13:33,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:13:33,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:33,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:13:33,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:33,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:13:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:34,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:13:34,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:34,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:13:34,746 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:13:34,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:13:34,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:34,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:13:34,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:13:34,754 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:13:34,832 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-11 14:13:34,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:13:34,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:13:36,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:13:36,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:13:36,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:13:36,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:13:36,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 73 [2019-01-11 14:13:36,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:13:36,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-11 14:13:36,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-11 14:13:36,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5208, Unknown=0, NotChecked=0, Total=5402 [2019-01-11 14:13:36,354 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 74 states. [2019-01-11 14:13:43,301 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-11 14:13:43,623 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-11 14:13:43,936 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-11 14:13:44,167 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 14:13:44,365 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 14:13:44,590 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 14:13:44,835 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-11 14:13:46,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:13:46,718 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2019-01-11 14:13:46,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-11 14:13:46,719 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 163 [2019-01-11 14:13:46,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:13:46,720 INFO L225 Difference]: With dead ends: 349 [2019-01-11 14:13:46,721 INFO L226 Difference]: Without dead ends: 259 [2019-01-11 14:13:46,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=931, Invalid=13349, Unknown=0, NotChecked=0, Total=14280 [2019-01-11 14:13:46,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-01-11 14:13:46,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2019-01-11 14:13:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-11 14:13:46,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2019-01-11 14:13:46,749 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2019-01-11 14:13:46,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:13:46,749 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2019-01-11 14:13:46,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-11 14:13:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2019-01-11 14:13:46,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-01-11 14:13:46,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:13:46,750 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-11 14:13:46,751 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:13:46,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:13:46,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1550952469, now seen corresponding path program 39 times [2019-01-11 14:13:46,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:13:46,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:46,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:13:46,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:46,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:13:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:47,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:13:47,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:47,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:13:47,629 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:13:47,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:13:47,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:47,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:13:47,637 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:13:47,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:13:47,663 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:13:47,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:13:47,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:13:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:13:48,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:13:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:13:49,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:13:49,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 73 [2019-01-11 14:13:49,383 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:13:49,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-11 14:13:49,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-11 14:13:49,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2019-01-11 14:13:49,384 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 74 states. [2019-01-11 14:13:51,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:13:51,280 INFO L93 Difference]: Finished difference Result 360 states and 364 transitions. [2019-01-11 14:13:51,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-11 14:13:51,280 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 167 [2019-01-11 14:13:51,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:13:51,282 INFO L225 Difference]: With dead ends: 360 [2019-01-11 14:13:51,282 INFO L226 Difference]: Without dead ends: 173 [2019-01-11 14:13:51,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 262 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2221, Invalid=7285, Unknown=0, NotChecked=0, Total=9506 [2019-01-11 14:13:51,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-11 14:13:51,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-01-11 14:13:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-11 14:13:51,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-01-11 14:13:51,311 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2019-01-11 14:13:51,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:13:51,311 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2019-01-11 14:13:51,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-11 14:13:51,311 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2019-01-11 14:13:51,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-11 14:13:51,312 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:13:51,312 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-11 14:13:51,312 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:13:51,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:13:51,313 INFO L82 PathProgramCache]: Analyzing trace with hash -810935949, now seen corresponding path program 40 times [2019-01-11 14:13:51,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:13:51,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:51,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:13:51,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:51,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:13:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:53,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:13:53,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:53,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:13:53,488 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:13:53,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:13:53,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:53,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:13:53,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:13:53,499 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:13:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:53,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:13:55,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:13:55,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:13:55,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:13:55,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:13:55,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 76 [2019-01-11 14:13:55,618 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:13:55,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-11 14:13:55,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-11 14:13:55,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=5650, Unknown=0, NotChecked=0, Total=5852 [2019-01-11 14:13:55,620 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 77 states. [2019-01-11 14:14:03,074 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-11 14:14:03,425 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-11 14:14:03,761 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-11 14:14:03,992 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 14:14:04,208 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 14:14:04,425 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 14:14:04,623 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 14:14:05,009 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-11 14:14:05,240 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-11 14:14:06,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:14:06,832 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2019-01-11 14:14:06,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-11 14:14:06,833 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 170 [2019-01-11 14:14:06,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:14:06,834 INFO L225 Difference]: With dead ends: 364 [2019-01-11 14:14:06,835 INFO L226 Difference]: Without dead ends: 270 [2019-01-11 14:14:06,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=995, Invalid=14505, Unknown=0, NotChecked=0, Total=15500 [2019-01-11 14:14:06,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-01-11 14:14:06,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2019-01-11 14:14:06,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-11 14:14:06,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2019-01-11 14:14:06,873 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 170 [2019-01-11 14:14:06,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:14:06,873 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2019-01-11 14:14:06,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-11 14:14:06,873 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2019-01-11 14:14:06,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-11 14:14:06,873 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:14:06,874 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-01-11 14:14:06,874 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:14:06,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:14:06,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484838, now seen corresponding path program 41 times [2019-01-11 14:14:06,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:14:06,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:06,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:14:06,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:06,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:14:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:08,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:14:08,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:08,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:14:08,422 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:14:08,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:14:08,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:08,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:14:08,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:14:08,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:14:08,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-11 14:14:08,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:14:08,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:14:09,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:14:09,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:14:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:14:10,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:14:10,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 76 [2019-01-11 14:14:10,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:14:10,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-11 14:14:10,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-11 14:14:10,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2019-01-11 14:14:10,938 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 77 states. [2019-01-11 14:14:12,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:14:12,752 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2019-01-11 14:14:12,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-11 14:14:12,753 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 174 [2019-01-11 14:14:12,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:14:12,754 INFO L225 Difference]: With dead ends: 375 [2019-01-11 14:14:12,754 INFO L226 Difference]: Without dead ends: 180 [2019-01-11 14:14:12,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 273 SyntacticMatches, 49 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2019-01-11 14:14:12,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-11 14:14:12,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-01-11 14:14:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-11 14:14:12,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-01-11 14:14:12,785 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 174 [2019-01-11 14:14:12,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:14:12,785 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-01-11 14:14:12,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-11 14:14:12,785 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-01-11 14:14:12,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-01-11 14:14:12,785 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:14:12,786 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2019-01-11 14:14:12,786 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:14:12,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:14:12,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1003391854, now seen corresponding path program 42 times [2019-01-11 14:14:12,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:14:12,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:12,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:14:12,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:12,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:14:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:14:14,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:14,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:14:14,820 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:14:14,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:14:14,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:14,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:14:14,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:14:14,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:14:14,874 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:14:14,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:14:14,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:14:16,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:14:16,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:14:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:14:16,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:14:16,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 79 [2019-01-11 14:14:16,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:14:16,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-11 14:14:16,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-11 14:14:16,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=6110, Unknown=0, NotChecked=0, Total=6320 [2019-01-11 14:14:16,934 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 80 states. [2019-01-11 14:14:23,285 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-11 14:14:23,646 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-11 14:14:23,996 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-11 14:14:24,235 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 14:14:24,463 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 14:14:24,684 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 14:14:24,899 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 14:14:25,109 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 14:14:25,507 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-11 14:14:25,774 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-11 14:14:27,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:14:27,397 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2019-01-11 14:14:27,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-11 14:14:27,397 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 177 [2019-01-11 14:14:27,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:14:27,399 INFO L225 Difference]: With dead ends: 379 [2019-01-11 14:14:27,400 INFO L226 Difference]: Without dead ends: 281 [2019-01-11 14:14:27,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1061, Invalid=15709, Unknown=0, NotChecked=0, Total=16770 [2019-01-11 14:14:27,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-01-11 14:14:27,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2019-01-11 14:14:27,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-01-11 14:14:27,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-01-11 14:14:27,439 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2019-01-11 14:14:27,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:14:27,439 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-01-11 14:14:27,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-11 14:14:27,440 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-01-11 14:14:27,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-11 14:14:27,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:14:27,441 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-01-11 14:14:27,441 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:14:27,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:14:27,441 INFO L82 PathProgramCache]: Analyzing trace with hash 525284025, now seen corresponding path program 43 times [2019-01-11 14:14:27,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:14:27,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:27,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:14:27,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:27,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:14:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:14:28,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:28,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:14:28,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:14:28,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:14:28,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:28,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:14:28,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:14:28,399 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:14:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:28,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:14:29,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:14:29,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:14:30,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:14:30,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:14:30,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 79 [2019-01-11 14:14:30,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:14:30,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-11 14:14:30,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-11 14:14:30,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2019-01-11 14:14:30,365 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 80 states. [2019-01-11 14:14:32,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:14:32,345 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2019-01-11 14:14:32,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-11 14:14:32,345 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 181 [2019-01-11 14:14:32,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:14:32,346 INFO L225 Difference]: With dead ends: 390 [2019-01-11 14:14:32,346 INFO L226 Difference]: Without dead ends: 187 [2019-01-11 14:14:32,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 284 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2588, Invalid=8542, Unknown=0, NotChecked=0, Total=11130 [2019-01-11 14:14:32,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-11 14:14:32,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-01-11 14:14:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-11 14:14:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2019-01-11 14:14:32,385 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 181 [2019-01-11 14:14:32,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:14:32,385 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2019-01-11 14:14:32,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-11 14:14:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2019-01-11 14:14:32,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-11 14:14:32,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:14:32,386 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2019-01-11 14:14:32,386 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:14:32,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:14:32,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1479170495, now seen corresponding path program 44 times [2019-01-11 14:14:32,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:14:32,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:32,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:14:32,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:32,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:14:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 25 proven. 2251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:14:34,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:34,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:14:34,156 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:14:34,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:14:34,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:34,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:14:34,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:14:34,165 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:14:34,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-11 14:14:34,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:14:34,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:14:38,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1250 proven. 1026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:14:38,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:14:42,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1225 proven. 1051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:14:42,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:14:42,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56, 56] total 138 [2019-01-11 14:14:42,737 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:14:42,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-11 14:14:42,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-11 14:14:42,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=17089, Unknown=0, NotChecked=0, Total=19182 [2019-01-11 14:14:42,738 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 111 states. [2019-01-11 14:15:00,216 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-11 14:15:00,671 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-11 14:15:01,141 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-11 14:15:01,599 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 14:15:02,002 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 14:15:02,354 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 14:15:02,698 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 14:15:03,017 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 14:15:03,320 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 14:15:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:15:06,484 INFO L93 Difference]: Finished difference Result 496 states and 502 transitions. [2019-01-11 14:15:06,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-01-11 14:15:06,484 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 184 [2019-01-11 14:15:06,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:15:06,485 INFO L225 Difference]: With dead ends: 496 [2019-01-11 14:15:06,485 INFO L226 Difference]: Without dead ends: 289 [2019-01-11 14:15:06,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 257 SyntacticMatches, 27 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18831 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=6295, Invalid=80435, Unknown=0, NotChecked=0, Total=86730 [2019-01-11 14:15:06,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-11 14:15:06,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2019-01-11 14:15:06,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-01-11 14:15:06,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2019-01-11 14:15:06,522 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 184 [2019-01-11 14:15:06,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:15:06,522 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2019-01-11 14:15:06,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-11 14:15:06,522 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2019-01-11 14:15:06,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-01-11 14:15:06,523 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:15:06,523 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2019-01-11 14:15:06,523 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:15:06,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:15:06,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1734936480, now seen corresponding path program 45 times [2019-01-11 14:15:06,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:15:06,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:06,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:15:06,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:06,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:15:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:08,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:15:08,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:08,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:15:08,500 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:15:08,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:15:08,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:08,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:15:08,509 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:15:08,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:15:08,536 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:15:08,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:15:08,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:15:10,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:15:10,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:15:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:15:10,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:15:10,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 85 [2019-01-11 14:15:10,690 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:15:10,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-11 14:15:10,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-11 14:15:10,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7084, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 14:15:10,691 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 86 states. [2019-01-11 14:15:19,236 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-11 14:15:19,635 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-11 14:15:20,024 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-11 14:15:20,290 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 14:15:20,552 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 14:15:20,807 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 14:15:21,046 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 14:15:21,280 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 14:15:21,504 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 14:15:21,711 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 14:15:21,961 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-11 14:15:24,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:15:24,045 INFO L93 Difference]: Finished difference Result 409 states and 414 transitions. [2019-01-11 14:15:24,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-11 14:15:24,045 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 191 [2019-01-11 14:15:24,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:15:24,047 INFO L225 Difference]: With dead ends: 409 [2019-01-11 14:15:24,047 INFO L226 Difference]: Without dead ends: 303 [2019-01-11 14:15:24,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1199, Invalid=18261, Unknown=0, NotChecked=0, Total=19460 [2019-01-11 14:15:24,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-01-11 14:15:24,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 196. [2019-01-11 14:15:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-11 14:15:24,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2019-01-11 14:15:24,085 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 191 [2019-01-11 14:15:24,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:15:24,085 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2019-01-11 14:15:24,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-11 14:15:24,086 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2019-01-11 14:15:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-01-11 14:15:24,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:15:24,086 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2019-01-11 14:15:24,087 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:15:24,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:15:24,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2056396679, now seen corresponding path program 46 times [2019-01-11 14:15:24,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:15:24,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:24,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:15:24,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:24,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:15:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:25,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:15:25,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:25,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:15:25,158 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:15:25,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:15:25,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:25,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:15:25,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:15:25,167 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:15:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:25,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:15:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:15:28,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:15:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:15:29,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:15:29,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 85 [2019-01-11 14:15:29,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:15:29,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-11 14:15:29,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-11 14:15:29,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 14:15:29,207 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 86 states. [2019-01-11 14:15:31,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:15:31,443 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2019-01-11 14:15:31,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-11 14:15:31,444 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 195 [2019-01-11 14:15:31,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:15:31,445 INFO L225 Difference]: With dead ends: 420 [2019-01-11 14:15:31,445 INFO L226 Difference]: Without dead ends: 201 [2019-01-11 14:15:31,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 306 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2983, Invalid=9899, Unknown=0, NotChecked=0, Total=12882 [2019-01-11 14:15:31,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-11 14:15:31,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-01-11 14:15:31,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-11 14:15:31,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2019-01-11 14:15:31,483 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 195 [2019-01-11 14:15:31,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:15:31,483 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2019-01-11 14:15:31,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-11 14:15:31,483 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2019-01-11 14:15:31,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-11 14:15:31,484 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:15:31,484 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2019-01-11 14:15:31,484 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:15:31,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:15:31,485 INFO L82 PathProgramCache]: Analyzing trace with hash -303839985, now seen corresponding path program 47 times [2019-01-11 14:15:31,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:15:31,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:31,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:15:31,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:31,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:15:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:15:33,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:33,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:15:33,377 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:15:33,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:15:33,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:33,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:15:33,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:15:33,386 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:15:33,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-11 14:15:33,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:15:33,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:15:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:15:35,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:15:35,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:15:35,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:15:35,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 88 [2019-01-11 14:15:35,604 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:15:35,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-11 14:15:35,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-11 14:15:35,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=7598, Unknown=0, NotChecked=0, Total=7832 [2019-01-11 14:15:35,605 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 89 states. [2019-01-11 14:15:44,100 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-11 14:15:44,514 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-11 14:15:44,923 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-11 14:15:45,213 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-11 14:15:45,491 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 14:15:45,770 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 14:15:46,028 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 14:15:46,282 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 14:15:46,534 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 14:15:46,764 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 14:15:46,988 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 14:15:47,202 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-11 14:15:47,436 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-11 14:15:49,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:15:49,448 INFO L93 Difference]: Finished difference Result 424 states and 429 transitions. [2019-01-11 14:15:49,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-01-11 14:15:49,448 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 198 [2019-01-11 14:15:49,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:15:49,450 INFO L225 Difference]: With dead ends: 424 [2019-01-11 14:15:49,450 INFO L226 Difference]: Without dead ends: 314 [2019-01-11 14:15:49,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=1271, Invalid=19609, Unknown=0, NotChecked=0, Total=20880 [2019-01-11 14:15:49,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-11 14:15:49,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2019-01-11 14:15:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-11 14:15:49,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2019-01-11 14:15:49,497 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 198 [2019-01-11 14:15:49,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:15:49,497 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2019-01-11 14:15:49,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-11 14:15:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2019-01-11 14:15:49,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-01-11 14:15:49,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:15:49,499 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-01-11 14:15:49,499 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:15:49,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:15:49,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1908736842, now seen corresponding path program 48 times [2019-01-11 14:15:49,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:15:49,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:49,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:15:49,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:49,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:15:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:15:50,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:50,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:15:50,829 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:15:50,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:15:50,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:50,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:15:50,838 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:15:50,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:15:50,868 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:15:50,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:15:50,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:15:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:15:52,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:15:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:15:53,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:15:53,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 88 [2019-01-11 14:15:53,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:15:53,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-11 14:15:53,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-11 14:15:53,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2019-01-11 14:15:53,729 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 89 states. [2019-01-11 14:15:56,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:15:56,123 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2019-01-11 14:15:56,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-11 14:15:56,123 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 202 [2019-01-11 14:15:56,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:15:56,124 INFO L225 Difference]: With dead ends: 435 [2019-01-11 14:15:56,124 INFO L226 Difference]: Without dead ends: 208 [2019-01-11 14:15:56,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 317 SyntacticMatches, 57 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3191, Invalid=10615, Unknown=0, NotChecked=0, Total=13806 [2019-01-11 14:15:56,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-01-11 14:15:56,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-01-11 14:15:56,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-11 14:15:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-01-11 14:15:56,173 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2019-01-11 14:15:56,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:15:56,173 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2019-01-11 14:15:56,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-11 14:15:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2019-01-11 14:15:56,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-11 14:15:56,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:15:56,174 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2019-01-11 14:15:56,174 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:15:56,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:15:56,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1062571566, now seen corresponding path program 49 times [2019-01-11 14:15:56,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:15:56,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:56,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:15:56,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:56,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:15:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:15:58,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:58,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:15:58,352 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:15:58,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:15:58,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:58,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:15:58,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:15:58,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:15:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:58,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:16:00,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:16:00,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:16:00,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:16:00,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:16:00,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 91 [2019-01-11 14:16:00,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:16:00,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-11 14:16:00,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-11 14:16:00,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=8130, Unknown=0, NotChecked=0, Total=8372 [2019-01-11 14:16:00,762 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 92 states. [2019-01-11 14:16:09,936 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-11 14:16:10,377 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-11 14:16:10,801 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-11 14:16:11,095 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-11 14:16:11,390 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-11 14:16:11,671 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 14:16:11,943 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 14:16:12,212 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 14:16:12,464 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 14:16:12,728 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 14:16:12,978 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 14:16:13,299 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 14:16:15,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:16:15,917 INFO L93 Difference]: Finished difference Result 439 states and 444 transitions. [2019-01-11 14:16:15,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-01-11 14:16:15,917 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 205 [2019-01-11 14:16:15,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:16:15,919 INFO L225 Difference]: With dead ends: 439 [2019-01-11 14:16:15,919 INFO L226 Difference]: Without dead ends: 325 [2019-01-11 14:16:15,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 376 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=1345, Invalid=21005, Unknown=0, NotChecked=0, Total=22350 [2019-01-11 14:16:15,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-11 14:16:15,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2019-01-11 14:16:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-11 14:16:15,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2019-01-11 14:16:15,973 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2019-01-11 14:16:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:16:15,974 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2019-01-11 14:16:15,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-11 14:16:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2019-01-11 14:16:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-01-11 14:16:15,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:16:15,975 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-01-11 14:16:15,975 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:16:15,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:16:15,976 INFO L82 PathProgramCache]: Analyzing trace with hash -782950827, now seen corresponding path program 50 times [2019-01-11 14:16:15,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:16:15,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:15,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:16:15,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:15,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:16:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:16:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:16:17,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:17,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:16:17,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:16:17,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:16:17,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:17,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:16:17,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:16:17,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:16:17,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-11 14:16:17,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:16:17,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:16:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:16:19,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:16:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:16:20,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:16:20,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 91 [2019-01-11 14:16:20,731 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:16:20,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-11 14:16:20,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-11 14:16:20,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2019-01-11 14:16:20,732 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 92 states. [2019-01-11 14:16:23,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:16:23,459 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2019-01-11 14:16:23,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-11 14:16:23,460 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 209 [2019-01-11 14:16:23,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:16:23,461 INFO L225 Difference]: With dead ends: 450 [2019-01-11 14:16:23,461 INFO L226 Difference]: Without dead ends: 215 [2019-01-11 14:16:23,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 328 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2019-01-11 14:16:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-11 14:16:23,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-01-11 14:16:23,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-11 14:16:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2019-01-11 14:16:23,509 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 209 [2019-01-11 14:16:23,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:16:23,509 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2019-01-11 14:16:23,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-11 14:16:23,510 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2019-01-11 14:16:23,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-11 14:16:23,511 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:16:23,511 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2019-01-11 14:16:23,511 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:16:23,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:16:23,511 INFO L82 PathProgramCache]: Analyzing trace with hash -890079779, now seen corresponding path program 51 times [2019-01-11 14:16:23,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:16:23,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:23,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:16:23,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:23,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:16:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:16:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:16:25,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:25,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:16:25,633 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:16:25,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:16:25,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:25,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:16:25,642 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:16:25,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:16:25,684 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:16:25,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:16:25,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:16:28,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:16:28,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:16:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:16:28,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:16:28,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 94 [2019-01-11 14:16:28,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:16:28,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-11 14:16:28,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-11 14:16:28,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8680, Unknown=0, NotChecked=0, Total=8930 [2019-01-11 14:16:28,565 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 95 states. [2019-01-11 14:16:38,727 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-11 14:16:39,288 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-11 14:16:39,729 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-11 14:16:40,044 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-11 14:16:40,356 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-11 14:16:40,654 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-11 14:16:40,957 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 14:16:41,238 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 14:16:41,512 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 14:16:41,771 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 14:16:42,021 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 14:16:42,271 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 14:16:42,497 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 14:16:45,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:16:45,111 INFO L93 Difference]: Finished difference Result 454 states and 459 transitions. [2019-01-11 14:16:45,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-01-11 14:16:45,111 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 212 [2019-01-11 14:16:45,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:16:45,113 INFO L225 Difference]: With dead ends: 454 [2019-01-11 14:16:45,113 INFO L226 Difference]: Without dead ends: 336 [2019-01-11 14:16:45,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=1421, Invalid=22449, Unknown=0, NotChecked=0, Total=23870 [2019-01-11 14:16:45,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-01-11 14:16:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 217. [2019-01-11 14:16:45,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-11 14:16:45,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2019-01-11 14:16:45,164 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 212 [2019-01-11 14:16:45,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:16:45,164 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2019-01-11 14:16:45,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-11 14:16:45,165 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2019-01-11 14:16:45,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-11 14:16:45,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:16:45,166 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1] [2019-01-11 14:16:45,166 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:16:45,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:16:45,166 INFO L82 PathProgramCache]: Analyzing trace with hash -272066940, now seen corresponding path program 52 times [2019-01-11 14:16:45,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:16:45,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:45,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:16:45,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:45,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:16:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:16:46,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:16:46,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:46,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:16:46,417 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:16:46,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:16:46,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:46,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:16:46,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:16:46,428 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:16:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:16:46,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:16:47,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:16:47,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:16:49,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:16:49,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:16:49,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 94 [2019-01-11 14:16:49,503 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:16:49,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-11 14:16:49,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-11 14:16:49,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2019-01-11 14:16:49,504 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 95 states. [2019-01-11 14:16:52,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:16:52,252 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2019-01-11 14:16:52,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-11 14:16:52,253 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 216 [2019-01-11 14:16:52,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:16:52,253 INFO L225 Difference]: With dead ends: 465 [2019-01-11 14:16:52,254 INFO L226 Difference]: Without dead ends: 222 [2019-01-11 14:16:52,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 339 SyntacticMatches, 61 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2019-01-11 14:16:52,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-01-11 14:16:52,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-01-11 14:16:52,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-01-11 14:16:52,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2019-01-11 14:16:52,298 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 216 [2019-01-11 14:16:52,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:16:52,298 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2019-01-11 14:16:52,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-11 14:16:52,298 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2019-01-11 14:16:52,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-01-11 14:16:52,299 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:16:52,299 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2019-01-11 14:16:52,299 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:16:52,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:16:52,300 INFO L82 PathProgramCache]: Analyzing trace with hash 292238844, now seen corresponding path program 53 times [2019-01-11 14:16:52,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:16:52,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:52,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:16:52,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:52,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:16:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:16:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 30 proven. 3226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:16:54,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:54,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:16:54,823 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:16:54,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:16:54,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:54,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:16:54,832 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:16:54,832 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:16:54,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-11 14:16:54,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:16:54,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:17:00,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1800 proven. 1456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:17:00,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:17:06,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1770 proven. 1486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:17:06,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:17:06,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66, 66] total 163 [2019-01-11 14:17:06,503 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:17:06,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-01-11 14:17:06,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-01-11 14:17:06,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2878, Invalid=23854, Unknown=0, NotChecked=0, Total=26732 [2019-01-11 14:17:06,504 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 131 states. [2019-01-11 14:17:30,808 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-11 14:17:31,397 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-11 14:17:32,012 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-11 14:17:32,524 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-11 14:17:33,016 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-11 14:17:33,500 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-11 14:17:33,953 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-11 14:17:34,406 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 14:17:34,845 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 14:17:35,352 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 14:17:35,753 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 14:17:36,136 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 14:17:36,510 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 14:17:36,865 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 14:17:40,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:17:40,724 INFO L93 Difference]: Finished difference Result 591 states and 597 transitions. [2019-01-11 14:17:40,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-01-11 14:17:40,724 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 219 [2019-01-11 14:17:40,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:17:40,725 INFO L225 Difference]: With dead ends: 591 [2019-01-11 14:17:40,725 INFO L226 Difference]: Without dead ends: 344 [2019-01-11 14:17:40,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 307 SyntacticMatches, 32 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26556 ImplicationChecksByTransitivity, 39.1s TimeCoverageRelationStatistics Valid=8585, Invalid=113565, Unknown=0, NotChecked=0, Total=122150 [2019-01-11 14:17:40,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-11 14:17:40,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2019-01-11 14:17:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-11 14:17:40,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2019-01-11 14:17:40,777 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 219 [2019-01-11 14:17:40,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:17:40,777 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2019-01-11 14:17:40,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-01-11 14:17:40,777 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2019-01-11 14:17:40,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-01-11 14:17:40,778 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:17:40,778 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2019-01-11 14:17:40,778 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:17:40,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:17:40,778 INFO L82 PathProgramCache]: Analyzing trace with hash 2116008107, now seen corresponding path program 54 times [2019-01-11 14:17:40,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:17:40,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:17:40,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:17:40,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:17:40,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:17:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:17:43,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:17:43,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:17:43,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:17:43,105 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:17:43,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:17:43,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:17:43,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:17:43,114 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:17:43,114 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:17:43,148 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:17:43,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:17:43,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:17:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:17:45,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:17:46,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:17:46,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:17:46,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 100 [2019-01-11 14:17:46,109 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:17:46,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-11 14:17:46,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-11 14:17:46,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=9834, Unknown=0, NotChecked=0, Total=10100 [2019-01-11 14:17:46,110 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 101 states. [2019-01-11 14:17:58,836 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-11 14:17:59,372 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-11 14:17:59,862 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-11 14:18:00,198 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-11 14:18:00,548 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-11 14:18:00,926 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-11 14:18:01,247 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-11 14:18:01,569 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-11 14:18:01,875 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 14:18:02,180 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 14:18:02,471 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 14:18:02,746 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 14:18:03,007 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 14:18:03,263 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 14:18:03,505 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 14:18:06,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:18:06,305 INFO L93 Difference]: Finished difference Result 484 states and 489 transitions. [2019-01-11 14:18:06,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-01-11 14:18:06,305 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 226 [2019-01-11 14:18:06,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:18:06,307 INFO L225 Difference]: With dead ends: 484 [2019-01-11 14:18:06,307 INFO L226 Difference]: Without dead ends: 358 [2019-01-11 14:18:06,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=1579, Invalid=25481, Unknown=0, NotChecked=0, Total=27060 [2019-01-11 14:18:06,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-01-11 14:18:06,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 231. [2019-01-11 14:18:06,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-11 14:18:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2019-01-11 14:18:06,359 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 226 [2019-01-11 14:18:06,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:18:06,360 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2019-01-11 14:18:06,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-11 14:18:06,360 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2019-01-11 14:18:06,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-11 14:18:06,361 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:18:06,361 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1] [2019-01-11 14:18:06,361 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:18:06,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:18:06,362 INFO L82 PathProgramCache]: Analyzing trace with hash -237256110, now seen corresponding path program 55 times [2019-01-11 14:18:06,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:18:06,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:18:06,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:18:06,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:18:06,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:18:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:18:07,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:18:07,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:18:07,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:18:07,878 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:18:07,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:18:07,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:18:07,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:18:07,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:18:07,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:18:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:18:07,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:18:09,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:18:09,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:18:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:18:11,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:18:11,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2019-01-11 14:18:11,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:18:11,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-11 14:18:11,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-11 14:18:11,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2019-01-11 14:18:11,490 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 101 states. [2019-01-11 14:18:13,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:18:13,779 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2019-01-11 14:18:13,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-11 14:18:13,779 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 230 [2019-01-11 14:18:13,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:18:13,781 INFO L225 Difference]: With dead ends: 495 [2019-01-11 14:18:13,781 INFO L226 Difference]: Without dead ends: 236 [2019-01-11 14:18:13,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 361 SyntacticMatches, 65 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6272 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2019-01-11 14:18:13,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-01-11 14:18:13,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2019-01-11 14:18:13,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-11 14:18:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2019-01-11 14:18:13,834 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 230 [2019-01-11 14:18:13,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:18:13,835 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2019-01-11 14:18:13,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-11 14:18:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2019-01-11 14:18:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-01-11 14:18:13,836 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:18:13,836 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2019-01-11 14:18:13,836 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:18:13,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:18:13,837 INFO L82 PathProgramCache]: Analyzing trace with hash -170528822, now seen corresponding path program 56 times [2019-01-11 14:18:13,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:18:13,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:18:13,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:18:13,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:18:13,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:18:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:18:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 32 proven. 3665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:18:16,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:18:16,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:18:16,560 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:18:16,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:18:16,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:18:16,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:18:16,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:18:16,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:18:16,635 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-11 14:18:16,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:18:16,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:18:23,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2048 proven. 1649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:18:23,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:18:29,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2016 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:18:29,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:18:29,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70, 70] total 173 [2019-01-11 14:18:29,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:18:29,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-01-11 14:18:29,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-01-11 14:18:29,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3227, Invalid=26875, Unknown=0, NotChecked=0, Total=30102 [2019-01-11 14:18:29,455 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 139 states. [2019-01-11 14:18:54,999 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-11 14:18:55,613 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-11 14:18:56,232 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-11 14:18:56,781 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-11 14:18:57,378 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-11 14:18:57,899 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-11 14:18:58,410 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-11 14:18:58,896 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-11 14:18:59,372 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-11 14:18:59,848 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 14:19:00,299 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 14:19:00,748 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 14:19:01,193 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 14:19:01,597 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 14:19:02,006 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 14:19:02,429 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 14:19:06,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:19:06,168 INFO L93 Difference]: Finished difference Result 629 states and 635 transitions. [2019-01-11 14:19:06,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-01-11 14:19:06,168 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 233 [2019-01-11 14:19:06,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:19:06,170 INFO L225 Difference]: With dead ends: 629 [2019-01-11 14:19:06,170 INFO L226 Difference]: Without dead ends: 366 [2019-01-11 14:19:06,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 327 SyntacticMatches, 34 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30017 ImplicationChecksByTransitivity, 43.6s TimeCoverageRelationStatistics Valid=9599, Invalid=128413, Unknown=0, NotChecked=0, Total=138012 [2019-01-11 14:19:06,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-11 14:19:06,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2019-01-11 14:19:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-11 14:19:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2019-01-11 14:19:06,225 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 233 [2019-01-11 14:19:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:19:06,225 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2019-01-11 14:19:06,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-01-11 14:19:06,225 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2019-01-11 14:19:06,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-11 14:19:06,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:19:06,226 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2019-01-11 14:19:06,227 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:19:06,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:19:06,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1552518521, now seen corresponding path program 57 times [2019-01-11 14:19:06,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:19:06,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:06,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:19:06,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:06,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:19:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:19:09,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:19:09,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:19:09,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:19:09,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:19:09,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:19:09,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:19:09,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:19:09,120 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:19:09,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:19:09,159 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:19:09,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:19:09,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:19:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:19:11,969 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:19:12,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:19:12,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:19:12,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 106 [2019-01-11 14:19:12,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:19:12,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-11 14:19:12,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-11 14:19:12,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=11060, Unknown=0, NotChecked=0, Total=11342 [2019-01-11 14:19:12,229 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 107 states. [2019-01-11 14:19:24,291 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-11 14:19:24,833 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-11 14:19:25,373 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-11 14:19:25,763 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-11 14:19:26,134 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-11 14:19:26,496 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-11 14:19:26,853 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-11 14:19:27,197 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-11 14:19:27,530 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-11 14:19:27,915 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-11 14:19:28,235 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 14:19:28,553 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 14:19:28,859 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 14:19:29,148 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 14:19:29,429 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 14:19:29,703 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 14:19:29,960 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 14:19:32,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:19:32,925 INFO L93 Difference]: Finished difference Result 514 states and 519 transitions. [2019-01-11 14:19:32,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-01-11 14:19:32,925 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 240 [2019-01-11 14:19:32,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:19:32,926 INFO L225 Difference]: With dead ends: 514 [2019-01-11 14:19:32,926 INFO L226 Difference]: Without dead ends: 380 [2019-01-11 14:19:32,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=1745, Invalid=28705, Unknown=0, NotChecked=0, Total=30450 [2019-01-11 14:19:32,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-01-11 14:19:32,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 245. [2019-01-11 14:19:32,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-01-11 14:19:32,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2019-01-11 14:19:32,982 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 240 [2019-01-11 14:19:32,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:19:32,982 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2019-01-11 14:19:32,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-11 14:19:32,982 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2019-01-11 14:19:32,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-01-11 14:19:32,983 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:19:32,983 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1] [2019-01-11 14:19:32,983 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:19:32,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:19:32,984 INFO L82 PathProgramCache]: Analyzing trace with hash 714244128, now seen corresponding path program 58 times [2019-01-11 14:19:32,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:19:32,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:32,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:19:32,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:32,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:19:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:19:34,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:19:34,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:19:34,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:19:34,544 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:19:34,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:19:34,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:19:34,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:19:34,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:19:34,553 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:19:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:19:34,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:19:36,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:19:36,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:19:38,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:19:38,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:19:38,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 106 [2019-01-11 14:19:38,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:19:38,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-11 14:19:38,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-11 14:19:38,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=8716, Unknown=0, NotChecked=0, Total=11342 [2019-01-11 14:19:38,243 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 107 states. [2019-01-11 14:19:40,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:19:40,717 INFO L93 Difference]: Finished difference Result 525 states and 529 transitions. [2019-01-11 14:19:40,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-11 14:19:40,718 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 244 [2019-01-11 14:19:40,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:19:40,719 INFO L225 Difference]: With dead ends: 525 [2019-01-11 14:19:40,719 INFO L226 Difference]: Without dead ends: 250 [2019-01-11 14:19:40,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 383 SyntacticMatches, 69 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7072 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=4586, Invalid=15436, Unknown=0, NotChecked=0, Total=20022 [2019-01-11 14:19:40,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-11 14:19:40,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-01-11 14:19:40,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-11 14:19:40,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2019-01-11 14:19:40,780 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 244 [2019-01-11 14:19:40,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:19:40,781 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2019-01-11 14:19:40,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-11 14:19:40,781 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2019-01-11 14:19:40,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-01-11 14:19:40,782 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:19:40,782 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2019-01-11 14:19:40,782 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:19:40,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:19:40,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1637071768, now seen corresponding path program 59 times [2019-01-11 14:19:40,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:19:40,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:40,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:19:40,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:40,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:19:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:19:43,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 34 proven. 4132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:19:43,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:19:43,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:19:43,798 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:19:43,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:19:43,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:19:43,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:19:43,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:19:43,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:19:43,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-11 14:19:43,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:19:43,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:19:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2312 proven. 1854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:19:51,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:19:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2278 proven. 1888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:19:58,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:19:58,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74, 74] total 183 [2019-01-11 14:19:58,357 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:19:58,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-01-11 14:19:58,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-01-11 14:19:58,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=30076, Unknown=0, NotChecked=0, Total=33672 [2019-01-11 14:19:58,359 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 147 states. [2019-01-11 14:20:25,914 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-11 14:20:26,556 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-11 14:20:27,216 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-11 14:20:27,835 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-11 14:20:28,430 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-11 14:20:29,112 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-11 14:20:29,681 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-11 14:20:30,231 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-11 14:20:30,777 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-11 14:20:31,306 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-11 14:20:31,811 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-11 14:20:32,309 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 14:20:32,798 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 14:20:33,255 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 14:20:33,695 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 14:20:34,125 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 14:20:34,560 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 14:20:34,960 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 14:20:38,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:38,880 INFO L93 Difference]: Finished difference Result 667 states and 673 transitions. [2019-01-11 14:20:38,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-01-11 14:20:38,880 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 247 [2019-01-11 14:20:38,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:38,883 INFO L225 Difference]: With dead ends: 667 [2019-01-11 14:20:38,883 INFO L226 Difference]: Without dead ends: 388 [2019-01-11 14:20:38,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 347 SyntacticMatches, 36 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33690 ImplicationChecksByTransitivity, 48.6s TimeCoverageRelationStatistics Valid=10669, Invalid=144173, Unknown=0, NotChecked=0, Total=154842 [2019-01-11 14:20:38,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-01-11 14:20:38,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 255. [2019-01-11 14:20:38,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-01-11 14:20:38,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2019-01-11 14:20:38,946 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 247 [2019-01-11 14:20:38,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:38,946 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2019-01-11 14:20:38,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-01-11 14:20:38,946 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2019-01-11 14:20:38,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-01-11 14:20:38,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:38,948 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2019-01-11 14:20:38,948 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:38,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:38,948 INFO L82 PathProgramCache]: Analyzing trace with hash -783420345, now seen corresponding path program 60 times [2019-01-11 14:20:38,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:38,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:38,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:20:38,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:38,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:42,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:42,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:42,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:42,130 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:20:42,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:20:42,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:42,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:42,140 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:20:42,140 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:20:42,179 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:20:42,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:20:42,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:45,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:45,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:45,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:45,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74, 74] total 112 [2019-01-11 14:20:45,820 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:45,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-11 14:20:45,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-11 14:20:45,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=12358, Unknown=0, NotChecked=0, Total=12656 [2019-01-11 14:20:45,822 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 113 states. [2019-01-11 14:20:59,653 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-11 14:21:00,373 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-11 14:21:00,949 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-11 14:21:01,359 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-11 14:21:01,766 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-11 14:21:02,164 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-11 14:21:02,560 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-11 14:21:02,934 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-11 14:21:03,293 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-11 14:21:03,650 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-11 14:21:03,994 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-11 14:21:04,334 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-11 14:21:04,658 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 14:21:05,022 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 14:21:05,365 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 14:21:05,667 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 14:21:05,948 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 14:21:06,226 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 14:21:06,495 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 14:21:09,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:09,436 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2019-01-11 14:21:09,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-01-11 14:21:09,437 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 254 [2019-01-11 14:21:09,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:09,438 INFO L225 Difference]: With dead ends: 544 [2019-01-11 14:21:09,438 INFO L226 Difference]: Without dead ends: 402 [2019-01-11 14:21:09,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5410 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=1919, Invalid=32121, Unknown=0, NotChecked=0, Total=34040 [2019-01-11 14:21:09,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-01-11 14:21:09,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259. [2019-01-11 14:21:09,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-01-11 14:21:09,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2019-01-11 14:21:09,502 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 254 [2019-01-11 14:21:09,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:09,502 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2019-01-11 14:21:09,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-11 14:21:09,503 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2019-01-11 14:21:09,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-01-11 14:21:09,504 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:09,504 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1] [2019-01-11 14:21:09,504 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:09,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:09,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1175113710, now seen corresponding path program 61 times [2019-01-11 14:21:09,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:09,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:09,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:21:09,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:09,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:11,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:11,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:11,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:11,604 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:21:11,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:21:11,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:11,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:11,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:11,613 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:11,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:13,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:13,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:15,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:15,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:15,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 112 [2019-01-11 14:21:15,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:15,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-11 14:21:15,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-11 14:21:15,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2019-01-11 14:21:15,781 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 113 states. [2019-01-11 14:21:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:18,668 INFO L93 Difference]: Finished difference Result 555 states and 559 transitions. [2019-01-11 14:21:18,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-11 14:21:18,668 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 258 [2019-01-11 14:21:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:18,669 INFO L225 Difference]: With dead ends: 555 [2019-01-11 14:21:18,669 INFO L226 Difference]: Without dead ends: 264 [2019-01-11 14:21:18,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 405 SyntacticMatches, 73 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7920 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2019-01-11 14:21:18,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-11 14:21:18,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-01-11 14:21:18,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-01-11 14:21:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2019-01-11 14:21:18,732 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2019-01-11 14:21:18,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:18,732 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2019-01-11 14:21:18,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-11 14:21:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2019-01-11 14:21:18,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-01-11 14:21:18,733 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:18,733 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2019-01-11 14:21:18,733 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:18,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:18,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1470273894, now seen corresponding path program 62 times [2019-01-11 14:21:18,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:18,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:18,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:18,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:18,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:22,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 36 proven. 4627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:22,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:22,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:22,078 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:21:22,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:21:22,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:22,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:22,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:21:22,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:21:22,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-11 14:21:22,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:21:22,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2592 proven. 2071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:30,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2556 proven. 2107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:37,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:37,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78, 78] total 193 [2019-01-11 14:21:37,943 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:37,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-01-11 14:21:37,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-01-11 14:21:37,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3985, Invalid=33457, Unknown=0, NotChecked=0, Total=37442 [2019-01-11 14:21:37,946 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 155 states. [2019-01-11 14:22:09,291 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-11 14:22:10,016 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-11 14:22:10,760 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-11 14:22:11,469 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-01-11 14:22:12,139 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-11 14:22:12,787 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-11 14:22:13,403 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-11 14:22:14,021 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-11 14:22:14,612 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-11 14:22:15,173 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-11 14:22:15,738 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-11 14:22:16,276 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-11 14:22:16,887 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-11 14:22:17,401 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 14:22:17,901 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 14:22:18,388 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 14:22:18,857 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 14:22:19,336 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 14:22:19,760 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 14:22:20,174 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 14:22:21,736 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-11 14:22:24,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:24,457 INFO L93 Difference]: Finished difference Result 705 states and 711 transitions. [2019-01-11 14:22:24,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-01-11 14:22:24,457 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 261 [2019-01-11 14:22:24,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:24,459 INFO L225 Difference]: With dead ends: 705 [2019-01-11 14:22:24,459 INFO L226 Difference]: Without dead ends: 410 [2019-01-11 14:22:24,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 367 SyntacticMatches, 38 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37575 ImplicationChecksByTransitivity, 54.7s TimeCoverageRelationStatistics Valid=11795, Invalid=160845, Unknown=0, NotChecked=0, Total=172640 [2019-01-11 14:22:24,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-01-11 14:22:24,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2019-01-11 14:22:24,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-01-11 14:22:24,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2019-01-11 14:22:24,533 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 261 [2019-01-11 14:22:24,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:24,533 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2019-01-11 14:22:24,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-01-11 14:22:24,533 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2019-01-11 14:22:24,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-01-11 14:22:24,534 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:24,534 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2019-01-11 14:22:24,535 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:24,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:24,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1569385749, now seen corresponding path program 63 times [2019-01-11 14:22:24,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:24,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:24,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:22:24,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:24,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:27,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:27,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:27,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:22:27,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:22:27,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:27,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:27,959 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:22:27,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:22:28,000 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:22:28,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:22:28,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:31,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:31,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:31,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:31,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78, 78] total 118 [2019-01-11 14:22:31,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:31,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-11 14:22:31,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-11 14:22:31,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=13728, Unknown=0, NotChecked=0, Total=14042 [2019-01-11 14:22:31,743 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 119 states. [2019-01-11 14:22:48,189 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-01-11 14:22:48,824 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-01-11 14:22:49,464 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-11 14:22:49,921 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-01-11 14:22:50,370 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-01-11 14:22:50,797 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-11 14:22:51,233 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-11 14:22:51,649 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-11 14:22:52,047 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-11 14:22:52,485 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-11 14:22:52,888 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-11 14:22:53,254 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-11 14:22:53,632 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-11 14:22:53,983 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-11 14:22:54,325 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 14:22:54,655 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 14:22:54,986 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 14:22:55,305 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 14:22:55,614 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 14:22:55,908 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 14:22:56,195 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 14:22:59,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:59,432 INFO L93 Difference]: Finished difference Result 574 states and 579 transitions. [2019-01-11 14:22:59,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-01-11 14:22:59,432 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 268 [2019-01-11 14:22:59,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:59,434 INFO L225 Difference]: With dead ends: 574 [2019-01-11 14:22:59,434 INFO L226 Difference]: Without dead ends: 424 [2019-01-11 14:22:59,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 493 SyntacticMatches, 3 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6014 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=2101, Invalid=35729, Unknown=0, NotChecked=0, Total=37830 [2019-01-11 14:22:59,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-01-11 14:22:59,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 273. [2019-01-11 14:22:59,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-11 14:22:59,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 275 transitions. [2019-01-11 14:22:59,512 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 275 transitions. Word has length 268 [2019-01-11 14:22:59,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:59,512 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 275 transitions. [2019-01-11 14:22:59,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-01-11 14:22:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 275 transitions. [2019-01-11 14:22:59,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-01-11 14:22:59,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:59,513 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1] [2019-01-11 14:22:59,513 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:59,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:59,514 INFO L82 PathProgramCache]: Analyzing trace with hash 107131324, now seen corresponding path program 64 times [2019-01-11 14:22:59,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:59,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:59,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:22:59,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:59,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:01,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:01,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:01,370 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:01,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:01,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:01,371 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:01,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:01,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:01,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:03,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:05,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:05,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:05,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 118 [2019-01-11 14:23:05,731 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:05,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-11 14:23:05,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-11 14:23:05,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3238, Invalid=10804, Unknown=0, NotChecked=0, Total=14042 [2019-01-11 14:23:05,733 INFO L87 Difference]: Start difference. First operand 273 states and 275 transitions. Second operand 119 states. [2019-01-11 14:23:09,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:09,050 INFO L93 Difference]: Finished difference Result 585 states and 589 transitions. [2019-01-11 14:23:09,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-11 14:23:09,050 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 272 [2019-01-11 14:23:09,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:09,052 INFO L225 Difference]: With dead ends: 585 [2019-01-11 14:23:09,052 INFO L226 Difference]: Without dead ends: 278 [2019-01-11 14:23:09,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 427 SyntacticMatches, 77 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8816 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=5656, Invalid=19150, Unknown=0, NotChecked=0, Total=24806 [2019-01-11 14:23:09,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-01-11 14:23:09,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2019-01-11 14:23:09,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-11 14:23:09,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2019-01-11 14:23:09,130 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 272 [2019-01-11 14:23:09,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:09,130 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2019-01-11 14:23:09,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-01-11 14:23:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2019-01-11 14:23:09,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-01-11 14:23:09,131 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:09,131 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 1, 1, 1, 1, 1] [2019-01-11 14:23:09,131 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:09,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:09,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1761642804, now seen corresponding path program 65 times [2019-01-11 14:23:09,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:09,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:09,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:09,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:09,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:12,464 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 38 proven. 5150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:12,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:12,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:12,465 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:12,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:12,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:12,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:12,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:23:12,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:23:12,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-11 14:23:12,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:23:12,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:21,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 2888 proven. 2300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:21,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 2850 proven. 2338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:30,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:30,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 82, 82] total 203 [2019-01-11 14:23:30,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:30,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-01-11 14:23:30,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-01-11 14:23:30,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4394, Invalid=37018, Unknown=0, NotChecked=0, Total=41412 [2019-01-11 14:23:30,384 INFO L87 Difference]: Start difference. First operand 276 states and 278 transitions. Second operand 163 states.