java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:10:11,276 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:10:11,278 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:10:11,290 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:10:11,290 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:10:11,291 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:10:11,293 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:10:11,295 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:10:11,297 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:10:11,298 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:10:11,299 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:10:11,300 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:10:11,301 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:10:11,302 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:10:11,303 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:10:11,304 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:10:11,305 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:10:11,307 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:10:11,310 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:10:11,311 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:10:11,313 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:10:11,314 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:10:11,317 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:10:11,317 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:10:11,317 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:10:11,319 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:10:11,320 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:10:11,321 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:10:11,322 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:10:11,323 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:10:11,323 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:10:11,324 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:10:11,324 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:10:11,325 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:10:11,326 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:10:11,327 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:10:11,327 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-02-28 10:10:11,340 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:10:11,341 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:10:11,342 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:10:11,342 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:10:11,342 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:10:11,342 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:10:11,343 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:10:11,343 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:10:11,343 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 10:10:11,343 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:10:11,343 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 10:10:11,344 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 10:10:11,344 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:10:11,344 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:10:11,345 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:10:11,345 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:10:11,345 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:10:11,345 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:10:11,346 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:10:11,346 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:10:11,346 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:10:11,346 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:10:11,346 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:10:11,347 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:10:11,347 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:10:11,347 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:10:11,347 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:10:11,347 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:10:11,348 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:10:11,348 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:10:11,348 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:10:11,348 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:10:11,349 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:10:11,349 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:10:11,349 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:10:11,349 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:10:11,349 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:10:11,350 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:10:11,350 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:10:11,350 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:10:11,379 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:10:11,392 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:10:11,396 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:10:11,397 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:10:11,398 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:10:11,399 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2019-02-28 10:10:11,399 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2019-02-28 10:10:11,435 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:10:11,437 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:10:11,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:10:11,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:10:11,438 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:10:11,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,465 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,473 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:10:11,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:10:11,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:10:11,475 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:10:11,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:10:11,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:10:11,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:10:11,496 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:10:11,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:10:11,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:10:11,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:10:11,826 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:10:11,826 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-02-28 10:10:11,827 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:10:11 BoogieIcfgContainer [2019-02-28 10:10:11,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:10:11,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:10:11,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:10:11,834 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:10:11,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/2) ... [2019-02-28 10:10:11,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48346055 and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:10:11, skipping insertion in model container [2019-02-28 10:10:11,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:10:11" (2/2) ... [2019-02-28 10:10:11,839 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2019-02-28 10:10:11,849 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:10:11,856 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 10:10:11,874 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 10:10:11,908 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:10:11,908 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:10:11,908 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:10:11,908 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:10:11,909 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:10:11,909 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:10:11,909 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:10:11,909 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:10:11,924 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-28 10:10:11,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:10:11,931 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:11,932 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:10:11,934 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:11,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:11,942 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-02-28 10:10:11,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:12,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:12,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:12,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:12,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:10:12,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 10:10:12,096 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:10:12,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:10:12,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:10:12,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:10:12,113 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-28 10:10:12,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:12,194 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-02-28 10:10:12,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:10:12,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-28 10:10:12,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:12,212 INFO L225 Difference]: With dead ends: 12 [2019-02-28 10:10:12,212 INFO L226 Difference]: Without dead ends: 7 [2019-02-28 10:10:12,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:10:12,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-28 10:10:12,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-28 10:10:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 10:10:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-02-28 10:10:12,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-02-28 10:10:12,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:12,252 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-02-28 10:10:12,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:10:12,252 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-28 10:10:12,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:10:12,253 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:12,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:10:12,254 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:12,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:12,254 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-02-28 10:10:12,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:12,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:12,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:10:12,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:12,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:12,407 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:10:12,410 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-02-28 10:10:12,457 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:10:12,458 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:10:12,623 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:10:12,624 INFO L272 AbstractInterpreter]: Visited 6 different actions 18 times. Merged at 4 different actions 9 times. Never widened. Performed 198 root evaluator evaluations with a maximum evaluation depth of 6. Performed 198 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:10:12,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:12,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:10:12,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:12,638 INFO 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-02-28 10:10:12,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:12,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:12,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-28 10:10:12,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:10:12,729 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:10:12,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:12,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-28 10:10:12,925 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:12,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:10:12,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:10:12,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-28 10:10:12,927 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-02-28 10:10:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:12,979 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-02-28 10:10:12,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:10:12,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-28 10:10:12,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:12,980 INFO L225 Difference]: With dead ends: 13 [2019-02-28 10:10:12,980 INFO L226 Difference]: Without dead ends: 9 [2019-02-28 10:10:12,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-28 10:10:12,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-28 10:10:12,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-28 10:10:12,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-28 10:10:12,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-02-28 10:10:12,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-02-28 10:10:12,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:12,985 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-02-28 10:10:12,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:10:12,985 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-02-28 10:10:12,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:10:12,985 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:12,985 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-02-28 10:10:12,986 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:12,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:12,986 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-02-28 10:10:12,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:12,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:12,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 10:10:13,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:13,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:13,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:13,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:13,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:13,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 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-02-28 10:10:13,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:13,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:13,151 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-28 10:10:13,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:13,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-28 10:10:13,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 10:10:13,161 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:13,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 10:10:13,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:13,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-02-28 10:10:13,354 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:13,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-28 10:10:13,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-28 10:10:13,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:10:13,355 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-02-28 10:10:13,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:13,542 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-02-28 10:10:13,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:10:13,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-28 10:10:13,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:13,548 INFO L225 Difference]: With dead ends: 16 [2019-02-28 10:10:13,548 INFO L226 Difference]: Without dead ends: 11 [2019-02-28 10:10:13,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:10:13,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-28 10:10:13,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-28 10:10:13,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-28 10:10:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-02-28 10:10:13,555 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-02-28 10:10:13,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:13,555 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-02-28 10:10:13,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-28 10:10:13,555 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-02-28 10:10:13,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-28 10:10:13,556 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:13,556 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-02-28 10:10:13,557 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:13,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:13,557 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-02-28 10:10:13,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:13,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:13,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:13,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:13,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:13,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-28 10:10:13,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:13,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:13,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:13,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:13,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:13,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:10:13,709 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:13,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:13,739 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:13,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:13,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-28 10:10:13,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:13,746 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-28 10:10:13,747 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:13,863 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-28 10:10:13,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:13,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-28 10:10:13,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:13,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:10:13,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:10:13,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:10:13,895 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-02-28 10:10:13,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:13,970 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-02-28 10:10:13,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:10:13,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-02-28 10:10:13,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:13,972 INFO L225 Difference]: With dead ends: 19 [2019-02-28 10:10:13,972 INFO L226 Difference]: Without dead ends: 13 [2019-02-28 10:10:13,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:10:13,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-28 10:10:13,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-28 10:10:13,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-28 10:10:13,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-02-28 10:10:13,976 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-02-28 10:10:13,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:13,976 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-02-28 10:10:13,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:10:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-02-28 10:10:13,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-28 10:10:13,977 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:13,977 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-02-28 10:10:13,978 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:13,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:13,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-02-28 10:10:13,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:13,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:13,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:13,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:13,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-28 10:10:14,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:14,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:14,048 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:14,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:14,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:14,048 INFO 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-02-28 10:10:14,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:14,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:14,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:10:14,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-28 10:10:14,084 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:14,221 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-28 10:10:14,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:14,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-02-28 10:10:14,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:14,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 10:10:14,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 10:10:14,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:10:14,243 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-02-28 10:10:14,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:14,371 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-02-28 10:10:14,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:10:14,372 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-02-28 10:10:14,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:14,373 INFO L225 Difference]: With dead ends: 22 [2019-02-28 10:10:14,373 INFO L226 Difference]: Without dead ends: 15 [2019-02-28 10:10:14,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:10:14,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-28 10:10:14,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-28 10:10:14,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-28 10:10:14,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-02-28 10:10:14,382 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-02-28 10:10:14,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:14,382 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-02-28 10:10:14,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 10:10:14,383 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-02-28 10:10:14,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-28 10:10:14,383 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:14,383 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-02-28 10:10:14,384 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:14,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:14,384 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-02-28 10:10:14,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:14,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:14,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:14,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:14,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:14,673 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-28 10:10:14,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:14,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:14,674 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:14,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:14,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:14,674 INFO 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-02-28 10:10:14,687 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:14,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:14,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-28 10:10:14,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:14,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:10:14,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:14,735 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-28 10:10:14,735 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:14,984 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-28 10:10:15,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:15,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-02-28 10:10:15,005 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:15,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:10:15,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:10:15,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:10:15,006 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-02-28 10:10:15,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:15,048 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-02-28 10:10:15,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:10:15,050 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-02-28 10:10:15,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:15,051 INFO L225 Difference]: With dead ends: 25 [2019-02-28 10:10:15,051 INFO L226 Difference]: Without dead ends: 17 [2019-02-28 10:10:15,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:10:15,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-28 10:10:15,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-28 10:10:15,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-28 10:10:15,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-02-28 10:10:15,056 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-02-28 10:10:15,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:15,056 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-02-28 10:10:15,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:10:15,056 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-02-28 10:10:15,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-28 10:10:15,057 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:15,057 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-02-28 10:10:15,057 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:15,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:15,057 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-02-28 10:10:15,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:15,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:15,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:15,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:15,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:15,167 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-28 10:10:15,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:15,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:15,167 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:15,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:15,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:15,168 INFO 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-02-28 10:10:15,177 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:15,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:15,207 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:15,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:15,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:10:15,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:15,215 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-28 10:10:15,215 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:15,533 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-28 10:10:15,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:15,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-02-28 10:10:15,552 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:15,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:10:15,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:10:15,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:10:15,553 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-02-28 10:10:15,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:15,648 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-02-28 10:10:15,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:10:15,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-02-28 10:10:15,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:15,649 INFO L225 Difference]: With dead ends: 28 [2019-02-28 10:10:15,649 INFO L226 Difference]: Without dead ends: 19 [2019-02-28 10:10:15,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:10:15,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-28 10:10:15,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-28 10:10:15,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-28 10:10:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-02-28 10:10:15,654 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-02-28 10:10:15,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:15,654 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-02-28 10:10:15,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:10:15,655 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-02-28 10:10:15,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-28 10:10:15,655 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:15,655 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-02-28 10:10:15,656 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:15,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:15,656 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-02-28 10:10:15,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:15,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:15,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:15,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:15,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-28 10:10:15,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:15,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:15,817 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:15,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:15,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:15,818 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:10:15,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:15,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:15,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:10:15,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:15,871 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-28 10:10:15,872 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:16,072 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-28 10:10:16,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:16,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-02-28 10:10:16,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:16,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:10:16,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:10:16,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:10:16,094 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-02-28 10:10:16,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:16,140 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-02-28 10:10:16,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:10:16,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-02-28 10:10:16,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:16,143 INFO L225 Difference]: With dead ends: 31 [2019-02-28 10:10:16,143 INFO L226 Difference]: Without dead ends: 21 [2019-02-28 10:10:16,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:10:16,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-28 10:10:16,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-28 10:10:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-28 10:10:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-02-28 10:10:16,148 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-02-28 10:10:16,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:16,148 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-02-28 10:10:16,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:10:16,148 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-02-28 10:10:16,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-28 10:10:16,149 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:16,149 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-02-28 10:10:16,149 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:16,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:16,149 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-02-28 10:10:16,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:16,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:16,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:16,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:16,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-28 10:10:16,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:16,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:16,300 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:16,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:16,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:16,300 INFO 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-02-28 10:10:16,316 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:16,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:16,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-28 10:10:16,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:16,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:10:16,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-28 10:10:16,347 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-28 10:10:16,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:16,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-02-28 10:10:16,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:16,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:10:16,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:10:16,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:10:16,578 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-02-28 10:10:16,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:16,820 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-02-28 10:10:16,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-28 10:10:16,820 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-02-28 10:10:16,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:16,821 INFO L225 Difference]: With dead ends: 34 [2019-02-28 10:10:16,821 INFO L226 Difference]: Without dead ends: 23 [2019-02-28 10:10:16,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:10:16,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-28 10:10:16,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-28 10:10:16,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-28 10:10:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-02-28 10:10:16,828 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-02-28 10:10:16,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:16,828 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-02-28 10:10:16,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:10:16,828 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-02-28 10:10:16,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-28 10:10:16,830 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:16,831 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-02-28 10:10:16,831 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:16,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:16,831 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-02-28 10:10:16,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:16,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:16,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:16,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:16,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:17,066 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-28 10:10:17,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:17,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:17,067 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:17,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:17,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:17,067 INFO 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-02-28 10:10:17,076 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:17,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:17,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:17,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:17,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:10:17,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:17,138 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-28 10:10:17,138 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:17,702 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-28 10:10:17,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:17,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-02-28 10:10:17,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:17,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:10:17,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:10:17,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:10:17,722 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-02-28 10:10:17,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:17,796 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-02-28 10:10:17,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-28 10:10:17,801 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-02-28 10:10:17,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:17,802 INFO L225 Difference]: With dead ends: 37 [2019-02-28 10:10:17,802 INFO L226 Difference]: Without dead ends: 25 [2019-02-28 10:10:17,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:10:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-28 10:10:17,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-28 10:10:17,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-28 10:10:17,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-02-28 10:10:17,810 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-02-28 10:10:17,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:17,811 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-02-28 10:10:17,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:10:17,811 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-02-28 10:10:17,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-28 10:10:17,812 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:17,812 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-02-28 10:10:17,812 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:17,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:17,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-02-28 10:10:17,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:17,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:17,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:17,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:17,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-28 10:10:18,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:18,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:18,117 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:18,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:18,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:18,117 INFO 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-02-28 10:10:18,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:18,135 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:18,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-28 10:10:18,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-28 10:10:18,170 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-28 10:10:18,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:18,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-02-28 10:10:18,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:18,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-28 10:10:18,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-28 10:10:18,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-28 10:10:18,725 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-02-28 10:10:18,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:18,808 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-02-28 10:10:18,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-28 10:10:18,810 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-02-28 10:10:18,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:18,810 INFO L225 Difference]: With dead ends: 40 [2019-02-28 10:10:18,810 INFO L226 Difference]: Without dead ends: 27 [2019-02-28 10:10:18,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-28 10:10:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-28 10:10:18,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-28 10:10:18,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-28 10:10:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-02-28 10:10:18,815 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-02-28 10:10:18,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:18,815 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-02-28 10:10:18,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-28 10:10:18,815 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-02-28 10:10:18,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-28 10:10:18,816 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:18,816 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-02-28 10:10:18,816 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:18,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:18,817 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-02-28 10:10:18,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:18,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:18,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:18,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:18,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-28 10:10:19,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:19,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:19,107 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:19,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:19,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:19,107 INFO 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-02-28 10:10:19,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:19,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:19,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-28 10:10:19,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:19,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:10:19,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:19,181 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-28 10:10:19,182 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:19,678 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-28 10:10:19,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:19,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-02-28 10:10:19,699 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:19,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-28 10:10:19,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-28 10:10:19,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-28 10:10:19,700 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-02-28 10:10:19,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:19,766 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-02-28 10:10:19,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-28 10:10:19,767 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-02-28 10:10:19,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:19,768 INFO L225 Difference]: With dead ends: 43 [2019-02-28 10:10:19,768 INFO L226 Difference]: Without dead ends: 29 [2019-02-28 10:10:19,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-28 10:10:19,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-28 10:10:19,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-28 10:10:19,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-28 10:10:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-02-28 10:10:19,774 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-02-28 10:10:19,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:19,775 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-02-28 10:10:19,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-28 10:10:19,775 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-02-28 10:10:19,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-28 10:10:19,776 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:19,776 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-02-28 10:10:19,776 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:19,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:19,776 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-02-28 10:10:19,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:19,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:19,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:19,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:19,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-28 10:10:19,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:19,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:19,928 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:19,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:19,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:19,928 INFO 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-02-28 10:10:19,947 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:19,947 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:19,992 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:19,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:19,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:10:19,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:20,003 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-28 10:10:20,003 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:20,317 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-28 10:10:20,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:20,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-02-28 10:10:20,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:20,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-28 10:10:20,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-28 10:10:20,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-28 10:10:20,338 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-02-28 10:10:20,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:20,485 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-02-28 10:10:20,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-28 10:10:20,485 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-02-28 10:10:20,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:20,486 INFO L225 Difference]: With dead ends: 46 [2019-02-28 10:10:20,487 INFO L226 Difference]: Without dead ends: 31 [2019-02-28 10:10:20,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-28 10:10:20,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-28 10:10:20,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-28 10:10:20,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-28 10:10:20,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-02-28 10:10:20,492 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-02-28 10:10:20,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:20,493 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-02-28 10:10:20,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-28 10:10:20,493 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-02-28 10:10:20,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-28 10:10:20,494 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:20,494 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-02-28 10:10:20,494 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:20,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:20,494 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-02-28 10:10:20,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:20,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:20,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:20,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:20,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-28 10:10:20,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:20,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:20,688 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:20,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:20,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:20,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:10:20,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:20,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:20,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-28 10:10:20,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:20,745 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-28 10:10:20,745 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:21,022 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-28 10:10:21,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:21,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-02-28 10:10:21,043 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:21,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-28 10:10:21,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-28 10:10:21,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-28 10:10:21,044 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-02-28 10:10:21,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:21,218 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-02-28 10:10:21,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-28 10:10:21,219 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-02-28 10:10:21,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:21,220 INFO L225 Difference]: With dead ends: 49 [2019-02-28 10:10:21,220 INFO L226 Difference]: Without dead ends: 33 [2019-02-28 10:10:21,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-28 10:10:21,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-28 10:10:21,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-28 10:10:21,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-28 10:10:21,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-02-28 10:10:21,226 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-02-28 10:10:21,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:21,227 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-02-28 10:10:21,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-28 10:10:21,227 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-02-28 10:10:21,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-28 10:10:21,228 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:21,228 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-02-28 10:10:21,228 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:21,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:21,229 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-02-28 10:10:21,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:21,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:21,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:21,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:21,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-28 10:10:21,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:21,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:21,405 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:21,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:21,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:21,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:10:21,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:21,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:21,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-28 10:10:21,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:21,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-28 10:10:21,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-28 10:10:21,465 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-28 10:10:21,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:21,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-02-28 10:10:21,860 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:21,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-28 10:10:21,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-28 10:10:21,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-28 10:10:21,861 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-02-28 10:10:21,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:21,916 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-02-28 10:10:21,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-28 10:10:21,918 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-02-28 10:10:21,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:21,919 INFO L225 Difference]: With dead ends: 52 [2019-02-28 10:10:21,919 INFO L226 Difference]: Without dead ends: 35 [2019-02-28 10:10:21,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-28 10:10:21,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-28 10:10:21,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-28 10:10:21,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-28 10:10:21,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-02-28 10:10:21,923 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-02-28 10:10:21,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:21,924 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-02-28 10:10:21,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-28 10:10:21,924 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-02-28 10:10:21,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-28 10:10:21,925 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:21,925 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-02-28 10:10:21,925 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:21,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:21,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-02-28 10:10:21,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:21,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:21,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:21,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:21,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:22,142 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-28 10:10:22,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:22,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:22,143 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:22,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:22,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:22,143 INFO 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-02-28 10:10:22,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:22,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:22,180 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:22,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:22,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-28 10:10:22,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:22,190 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-28 10:10:22,190 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:22,662 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-28 10:10:22,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:22,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-02-28 10:10:22,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:22,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-28 10:10:22,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-28 10:10:22,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-28 10:10:22,685 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-02-28 10:10:22,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:22,798 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-02-28 10:10:22,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-28 10:10:22,799 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-02-28 10:10:22,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:22,800 INFO L225 Difference]: With dead ends: 55 [2019-02-28 10:10:22,800 INFO L226 Difference]: Without dead ends: 37 [2019-02-28 10:10:22,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-28 10:10:22,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-28 10:10:22,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-28 10:10:22,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-28 10:10:22,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-02-28 10:10:22,806 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-02-28 10:10:22,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:22,807 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-02-28 10:10:22,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-28 10:10:22,807 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-02-28 10:10:22,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-28 10:10:22,808 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:22,808 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-02-28 10:10:22,808 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:22,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:22,808 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-02-28 10:10:22,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:22,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:22,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:22,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:22,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-28 10:10:23,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:23,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:23,500 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:23,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:23,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:23,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 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-02-28 10:10:23,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:23,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:23,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-28 10:10:23,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:23,544 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-28 10:10:23,545 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-28 10:10:24,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:24,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-02-28 10:10:24,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:24,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-28 10:10:24,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-28 10:10:24,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-28 10:10:24,263 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-02-28 10:10:24,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:24,345 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-02-28 10:10:24,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-28 10:10:24,345 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-02-28 10:10:24,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:24,346 INFO L225 Difference]: With dead ends: 58 [2019-02-28 10:10:24,346 INFO L226 Difference]: Without dead ends: 39 [2019-02-28 10:10:24,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-28 10:10:24,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-28 10:10:24,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-28 10:10:24,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-28 10:10:24,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-02-28 10:10:24,352 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-02-28 10:10:24,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:24,352 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-02-28 10:10:24,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-28 10:10:24,353 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-02-28 10:10:24,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-28 10:10:24,353 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:24,353 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-02-28 10:10:24,354 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:24,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:24,354 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-02-28 10:10:24,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:24,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:24,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:24,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:24,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-28 10:10:24,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:24,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:24,594 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:24,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:24,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:24,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:10:24,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:24,603 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:24,649 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-28 10:10:24,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:24,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-28 10:10:24,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:24,661 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-28 10:10:24,661 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:25,418 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-28 10:10:25,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:25,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-02-28 10:10:25,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:25,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-28 10:10:25,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-28 10:10:25,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:10:25,441 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-02-28 10:10:25,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:25,512 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-02-28 10:10:25,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-28 10:10:25,513 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-02-28 10:10:25,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:25,514 INFO L225 Difference]: With dead ends: 61 [2019-02-28 10:10:25,514 INFO L226 Difference]: Without dead ends: 41 [2019-02-28 10:10:25,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:10:25,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-28 10:10:25,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-28 10:10:25,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-28 10:10:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-02-28 10:10:25,519 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-02-28 10:10:25,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:25,520 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-02-28 10:10:25,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-28 10:10:25,520 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-02-28 10:10:25,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-28 10:10:25,520 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:25,521 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-02-28 10:10:25,521 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:25,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:25,521 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-02-28 10:10:25,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:25,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:25,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:25,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:25,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:25,980 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-28 10:10:25,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:25,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:25,980 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:25,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:25,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:25,981 INFO 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-02-28 10:10:26,001 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:26,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:26,043 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:26,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:26,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-28 10:10:26,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:26,054 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-28 10:10:26,054 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:26,581 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-28 10:10:26,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:26,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-02-28 10:10:26,603 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:26,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-28 10:10:26,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-28 10:10:26,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-28 10:10:26,604 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-02-28 10:10:26,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:26,780 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-02-28 10:10:26,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-28 10:10:26,780 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-02-28 10:10:26,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:26,780 INFO L225 Difference]: With dead ends: 64 [2019-02-28 10:10:26,780 INFO L226 Difference]: Without dead ends: 43 [2019-02-28 10:10:26,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-28 10:10:26,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-28 10:10:26,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-28 10:10:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-28 10:10:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-02-28 10:10:26,785 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-02-28 10:10:26,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:26,785 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-02-28 10:10:26,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-28 10:10:26,785 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-02-28 10:10:26,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-28 10:10:26,786 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:26,786 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-02-28 10:10:26,786 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:26,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:26,787 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-02-28 10:10:26,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:26,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:26,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:26,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:26,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-28 10:10:27,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:27,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:27,089 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:27,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:27,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:27,089 INFO 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-02-28 10:10:27,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:27,098 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:27,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-28 10:10:27,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-28 10:10:27,135 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-28 10:10:27,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:27,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-02-28 10:10:27,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:27,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-28 10:10:27,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-28 10:10:27,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-28 10:10:27,665 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-02-28 10:10:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:27,742 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-02-28 10:10:27,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-28 10:10:27,743 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-02-28 10:10:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:27,744 INFO L225 Difference]: With dead ends: 67 [2019-02-28 10:10:27,744 INFO L226 Difference]: Without dead ends: 45 [2019-02-28 10:10:27,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-28 10:10:27,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-28 10:10:27,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-28 10:10:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-28 10:10:27,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-02-28 10:10:27,749 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-02-28 10:10:27,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:27,750 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-02-28 10:10:27,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-28 10:10:27,750 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-02-28 10:10:27,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-28 10:10:27,750 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:27,751 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-02-28 10:10:27,751 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:27,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:27,751 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-02-28 10:10:27,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:27,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:27,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:27,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:27,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:28,112 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-28 10:10:28,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:28,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:28,113 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:28,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:28,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:28,113 INFO 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-02-28 10:10:28,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:28,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:28,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-28 10:10:28,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:28,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-28 10:10:28,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:28,206 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-28 10:10:28,206 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:28,701 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-28 10:10:28,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:28,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-02-28 10:10:28,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:28,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-28 10:10:28,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-28 10:10:28,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-28 10:10:28,722 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-02-28 10:10:28,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:28,829 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-02-28 10:10:28,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-28 10:10:28,829 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-02-28 10:10:28,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:28,830 INFO L225 Difference]: With dead ends: 70 [2019-02-28 10:10:28,830 INFO L226 Difference]: Without dead ends: 47 [2019-02-28 10:10:28,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-28 10:10:28,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-28 10:10:28,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-28 10:10:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-28 10:10:28,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-02-28 10:10:28,836 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-02-28 10:10:28,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:28,836 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-02-28 10:10:28,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-28 10:10:28,836 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-02-28 10:10:28,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-28 10:10:28,837 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:28,837 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-02-28 10:10:28,837 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:28,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:28,837 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-02-28 10:10:28,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:28,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:28,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:28,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:28,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:29,617 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-28 10:10:29,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:29,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:29,618 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:29,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:29,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:29,618 INFO 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-02-28 10:10:29,627 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:29,627 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:29,659 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:29,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:29,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 23 conjunts are in the unsatisfiable core [2019-02-28 10:10:29,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:29,671 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-28 10:10:29,671 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-28 10:10:30,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:30,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-02-28 10:10:30,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:30,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-28 10:10:30,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-28 10:10:30,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-28 10:10:30,232 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-02-28 10:10:30,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:30,352 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-02-28 10:10:30,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-28 10:10:30,354 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-02-28 10:10:30,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:30,355 INFO L225 Difference]: With dead ends: 73 [2019-02-28 10:10:30,355 INFO L226 Difference]: Without dead ends: 49 [2019-02-28 10:10:30,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-28 10:10:30,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-28 10:10:30,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-28 10:10:30,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-28 10:10:30,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-02-28 10:10:30,360 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-02-28 10:10:30,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:30,360 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-02-28 10:10:30,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-28 10:10:30,361 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-02-28 10:10:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-28 10:10:30,361 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:30,361 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-02-28 10:10:30,361 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:30,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:30,362 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-02-28 10:10:30,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:30,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:30,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:30,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:30,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-28 10:10:30,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:30,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:30,749 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:30,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:30,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:30,749 INFO 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-02-28 10:10:30,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:30,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:30,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 24 conjunts are in the unsatisfiable core [2019-02-28 10:10:30,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-28 10:10:30,802 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-28 10:10:31,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:31,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-02-28 10:10:31,403 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:31,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-28 10:10:31,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-28 10:10:31,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-28 10:10:31,405 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-02-28 10:10:31,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:31,555 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-02-28 10:10:31,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-28 10:10:31,557 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-02-28 10:10:31,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:31,558 INFO L225 Difference]: With dead ends: 76 [2019-02-28 10:10:31,558 INFO L226 Difference]: Without dead ends: 51 [2019-02-28 10:10:31,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-28 10:10:31,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-28 10:10:31,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-28 10:10:31,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-28 10:10:31,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-02-28 10:10:31,562 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-02-28 10:10:31,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:31,563 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-02-28 10:10:31,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-28 10:10:31,563 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-02-28 10:10:31,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-28 10:10:31,563 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:31,564 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-02-28 10:10:31,564 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:31,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:31,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-02-28 10:10:31,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:31,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:31,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:31,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:31,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:31,907 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-28 10:10:31,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:31,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:31,908 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:31,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:31,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:31,908 INFO 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-02-28 10:10:31,916 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:31,916 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:31,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-28 10:10:32,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:32,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2019-02-28 10:10:32,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:32,014 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-28 10:10:32,014 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-28 10:10:32,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:32,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-02-28 10:10:32,749 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:32,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-28 10:10:32,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-28 10:10:32,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:10:32,750 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-02-28 10:10:32,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:32,834 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-02-28 10:10:32,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-28 10:10:32,835 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-02-28 10:10:32,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:32,835 INFO L225 Difference]: With dead ends: 79 [2019-02-28 10:10:32,836 INFO L226 Difference]: Without dead ends: 53 [2019-02-28 10:10:32,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:10:32,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-28 10:10:32,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-28 10:10:32,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-28 10:10:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-02-28 10:10:32,841 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-02-28 10:10:32,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:32,841 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-02-28 10:10:32,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-28 10:10:32,841 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-02-28 10:10:32,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-28 10:10:32,841 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:32,841 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-02-28 10:10:32,842 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:32,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:32,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-02-28 10:10:32,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:32,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:32,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:32,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:32,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:33,252 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-28 10:10:33,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:33,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:33,253 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:33,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:33,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:33,253 INFO 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-02-28 10:10:33,264 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:33,265 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:33,310 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:33,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:33,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-28 10:10:33,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:33,319 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-28 10:10:33,319 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:34,092 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-28 10:10:34,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:34,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-02-28 10:10:34,110 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:34,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-28 10:10:34,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-28 10:10:34,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-28 10:10:34,112 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-02-28 10:10:34,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:34,244 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-02-28 10:10:34,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-28 10:10:34,245 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-02-28 10:10:34,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:34,245 INFO L225 Difference]: With dead ends: 82 [2019-02-28 10:10:34,245 INFO L226 Difference]: Without dead ends: 55 [2019-02-28 10:10:34,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-28 10:10:34,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-28 10:10:34,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-28 10:10:34,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-28 10:10:34,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-02-28 10:10:34,249 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-02-28 10:10:34,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:34,250 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-02-28 10:10:34,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-28 10:10:34,250 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-02-28 10:10:34,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-28 10:10:34,250 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:34,251 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-02-28 10:10:34,251 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:34,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:34,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-02-28 10:10:34,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:34,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:34,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:34,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:34,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-28 10:10:34,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:34,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:34,856 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:34,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:34,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:34,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:10:34,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:34,865 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:34,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 27 conjunts are in the unsatisfiable core [2019-02-28 10:10:34,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:34,911 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-28 10:10:34,911 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-28 10:10:36,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:36,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-02-28 10:10:36,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:36,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-28 10:10:36,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-28 10:10:36,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-28 10:10:36,642 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-02-28 10:10:36,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:36,735 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-02-28 10:10:36,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-28 10:10:36,735 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-02-28 10:10:36,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:36,736 INFO L225 Difference]: With dead ends: 85 [2019-02-28 10:10:36,736 INFO L226 Difference]: Without dead ends: 57 [2019-02-28 10:10:36,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-28 10:10:36,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-28 10:10:36,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-28 10:10:36,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-28 10:10:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-02-28 10:10:36,743 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-02-28 10:10:36,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:36,743 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-02-28 10:10:36,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-28 10:10:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-02-28 10:10:36,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-28 10:10:36,743 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:36,744 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-02-28 10:10:36,744 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:36,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:36,744 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-02-28 10:10:36,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:36,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:36,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:36,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:36,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:37,654 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-28 10:10:37,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:37,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:37,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:37,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:37,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:37,655 INFO 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-02-28 10:10:37,663 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:37,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:37,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-28 10:10:37,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:37,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 28 conjunts are in the unsatisfiable core [2019-02-28 10:10:37,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-28 10:10:37,773 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-28 10:10:38,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:38,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-02-28 10:10:38,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:38,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-28 10:10:38,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-28 10:10:38,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-28 10:10:38,551 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-02-28 10:10:38,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:38,643 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-02-28 10:10:38,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-28 10:10:38,644 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-02-28 10:10:38,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:38,644 INFO L225 Difference]: With dead ends: 88 [2019-02-28 10:10:38,645 INFO L226 Difference]: Without dead ends: 59 [2019-02-28 10:10:38,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-28 10:10:38,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-28 10:10:38,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-28 10:10:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-28 10:10:38,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-02-28 10:10:38,649 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-02-28 10:10:38,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:38,649 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-02-28 10:10:38,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-28 10:10:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-02-28 10:10:38,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-28 10:10:38,650 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:38,650 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-02-28 10:10:38,651 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:38,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:38,651 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-02-28 10:10:38,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:38,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:38,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:38,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:38,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-28 10:10:39,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:39,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:39,109 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:39,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:39,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:39,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 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-02-28 10:10:39,119 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:39,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:39,161 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:39,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:39,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 29 conjunts are in the unsatisfiable core [2019-02-28 10:10:39,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:39,174 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-28 10:10:39,174 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-28 10:10:40,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:40,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-02-28 10:10:40,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:40,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-28 10:10:40,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-28 10:10:40,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-28 10:10:40,353 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-02-28 10:10:40,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:40,468 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-02-28 10:10:40,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-28 10:10:40,468 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-02-28 10:10:40,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:40,469 INFO L225 Difference]: With dead ends: 91 [2019-02-28 10:10:40,469 INFO L226 Difference]: Without dead ends: 61 [2019-02-28 10:10:40,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-28 10:10:40,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-28 10:10:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-28 10:10:40,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-28 10:10:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-02-28 10:10:40,473 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-02-28 10:10:40,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:40,474 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-02-28 10:10:40,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-28 10:10:40,474 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-02-28 10:10:40,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-28 10:10:40,474 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:40,475 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-02-28 10:10:40,475 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:40,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:40,475 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-02-28 10:10:40,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:40,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:40,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:40,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:40,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:40,937 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-28 10:10:40,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:40,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:40,938 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:40,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:40,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:40,938 INFO 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-02-28 10:10:40,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:40,946 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:40,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-28 10:10:40,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:41,009 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-28 10:10:41,010 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:42,067 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-28 10:10:42,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:42,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-02-28 10:10:42,085 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:42,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-28 10:10:42,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-28 10:10:42,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-28 10:10:42,087 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-02-28 10:10:42,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:42,202 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-02-28 10:10:42,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-28 10:10:42,202 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-02-28 10:10:42,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:42,203 INFO L225 Difference]: With dead ends: 94 [2019-02-28 10:10:42,203 INFO L226 Difference]: Without dead ends: 63 [2019-02-28 10:10:42,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-28 10:10:42,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-28 10:10:42,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-28 10:10:42,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-28 10:10:42,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-02-28 10:10:42,208 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-02-28 10:10:42,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:42,208 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-02-28 10:10:42,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-28 10:10:42,208 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-02-28 10:10:42,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-28 10:10:42,209 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:42,209 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-02-28 10:10:42,209 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:42,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:42,209 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-02-28 10:10:42,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:42,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:42,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:42,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:42,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:42,673 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-28 10:10:42,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:42,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:42,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:42,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:42,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:42,674 INFO 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-02-28 10:10:42,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:42,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:42,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-28 10:10:42,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:42,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 31 conjunts are in the unsatisfiable core [2019-02-28 10:10:42,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:42,853 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-28 10:10:42,853 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:43,830 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-28 10:10:43,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:43,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-02-28 10:10:43,850 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:43,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-28 10:10:43,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-28 10:10:43,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-28 10:10:43,852 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-02-28 10:10:43,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:43,959 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-02-28 10:10:43,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-28 10:10:43,959 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-02-28 10:10:43,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:43,960 INFO L225 Difference]: With dead ends: 97 [2019-02-28 10:10:43,960 INFO L226 Difference]: Without dead ends: 65 [2019-02-28 10:10:43,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-28 10:10:43,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-28 10:10:43,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-28 10:10:43,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-28 10:10:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-02-28 10:10:43,963 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-02-28 10:10:43,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:43,963 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-02-28 10:10:43,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-28 10:10:43,963 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-02-28 10:10:43,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-28 10:10:43,963 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:43,964 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-02-28 10:10:43,964 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:43,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:43,964 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-02-28 10:10:43,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:43,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:43,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:43,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:43,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:44,910 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-28 10:10:44,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:44,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:44,910 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:44,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:44,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:44,911 INFO 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-02-28 10:10:44,920 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:44,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:44,963 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:44,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:44,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 32 conjunts are in the unsatisfiable core [2019-02-28 10:10:44,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:44,974 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-28 10:10:44,974 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-28 10:10:46,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:46,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-02-28 10:10:46,028 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:46,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-28 10:10:46,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-28 10:10:46,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-28 10:10:46,029 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-02-28 10:10:46,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:46,171 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-02-28 10:10:46,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-28 10:10:46,171 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-02-28 10:10:46,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:46,172 INFO L225 Difference]: With dead ends: 100 [2019-02-28 10:10:46,172 INFO L226 Difference]: Without dead ends: 67 [2019-02-28 10:10:46,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-28 10:10:46,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-28 10:10:46,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-28 10:10:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-28 10:10:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-02-28 10:10:46,176 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-02-28 10:10:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:46,176 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-02-28 10:10:46,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-28 10:10:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-02-28 10:10:46,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-28 10:10:46,177 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:46,177 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-02-28 10:10:46,177 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:46,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:46,178 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-02-28 10:10:46,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:46,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:46,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:46,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:46,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:46,697 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-28 10:10:46,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:46,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:46,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:46,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:46,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:46,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:10:46,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:46,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:46,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 33 conjunts are in the unsatisfiable core [2019-02-28 10:10:46,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:46,765 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-28 10:10:46,766 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:47,862 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-28 10:10:47,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:47,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-02-28 10:10:47,881 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:47,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-28 10:10:47,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-28 10:10:47,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-28 10:10:47,882 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-02-28 10:10:48,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:48,026 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-02-28 10:10:48,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-28 10:10:48,027 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-02-28 10:10:48,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:48,027 INFO L225 Difference]: With dead ends: 103 [2019-02-28 10:10:48,028 INFO L226 Difference]: Without dead ends: 69 [2019-02-28 10:10:48,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-28 10:10:48,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-28 10:10:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-28 10:10:48,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-28 10:10:48,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-02-28 10:10:48,032 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-02-28 10:10:48,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:48,032 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-02-28 10:10:48,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-28 10:10:48,032 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-02-28 10:10:48,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-28 10:10:48,033 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:48,033 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-02-28 10:10:48,033 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:48,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:48,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-02-28 10:10:48,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:48,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:48,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:48,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:48,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-28 10:10:49,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:49,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:49,095 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:49,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:49,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:49,095 INFO 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-02-28 10:10:49,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:49,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:49,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-28 10:10:49,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:49,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-28 10:10:49,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-28 10:10:49,277 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:50,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-28 10:10:50,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:50,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-02-28 10:10:50,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:50,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-28 10:10:50,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-28 10:10:50,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-28 10:10:50,675 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-02-28 10:10:50,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:50,822 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-02-28 10:10:50,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-28 10:10:50,822 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-02-28 10:10:50,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:50,823 INFO L225 Difference]: With dead ends: 106 [2019-02-28 10:10:50,823 INFO L226 Difference]: Without dead ends: 71 [2019-02-28 10:10:50,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-28 10:10:50,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-28 10:10:50,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-28 10:10:50,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-28 10:10:50,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-02-28 10:10:50,828 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-02-28 10:10:50,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:50,828 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-02-28 10:10:50,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-28 10:10:50,828 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-02-28 10:10:50,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-28 10:10:50,829 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:50,829 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-02-28 10:10:50,829 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:50,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:50,829 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-02-28 10:10:50,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:50,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:50,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:50,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:50,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:51,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-28 10:10:51,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:51,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:51,436 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:51,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:51,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:51,436 INFO 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-02-28 10:10:51,444 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:51,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:51,495 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:51,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:51,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 35 conjunts are in the unsatisfiable core [2019-02-28 10:10:51,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:51,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-28 10:10:51,507 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:52,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-28 10:10:52,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:52,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-02-28 10:10:52,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:52,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-28 10:10:52,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-28 10:10:52,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:10:52,743 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-02-28 10:10:52,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:52,914 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-02-28 10:10:52,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-28 10:10:52,915 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-02-28 10:10:52,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:52,915 INFO L225 Difference]: With dead ends: 109 [2019-02-28 10:10:52,916 INFO L226 Difference]: Without dead ends: 73 [2019-02-28 10:10:52,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:10:52,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-28 10:10:52,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-28 10:10:52,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-28 10:10:52,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-02-28 10:10:52,919 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-02-28 10:10:52,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:52,919 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-02-28 10:10:52,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-28 10:10:52,919 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-02-28 10:10:52,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-28 10:10:52,919 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:52,920 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-02-28 10:10:52,920 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:52,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:52,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-02-28 10:10:52,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:52,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:52,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:52,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:52,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:53,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-28 10:10:53,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:53,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:53,472 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:53,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:53,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:53,472 INFO 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-02-28 10:10:53,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:53,482 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:53,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 36 conjunts are in the unsatisfiable core [2019-02-28 10:10:53,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:53,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-28 10:10:53,543 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-28 10:10:55,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:55,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-02-28 10:10:55,060 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:55,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-28 10:10:55,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-28 10:10:55,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-28 10:10:55,061 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-02-28 10:10:55,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:55,283 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-02-28 10:10:55,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-28 10:10:55,283 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-02-28 10:10:55,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:55,284 INFO L225 Difference]: With dead ends: 112 [2019-02-28 10:10:55,284 INFO L226 Difference]: Without dead ends: 75 [2019-02-28 10:10:55,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-28 10:10:55,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-28 10:10:55,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-28 10:10:55,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-28 10:10:55,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-02-28 10:10:55,289 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-02-28 10:10:55,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:55,290 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-02-28 10:10:55,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-28 10:10:55,290 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-02-28 10:10:55,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-28 10:10:55,290 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:55,290 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-02-28 10:10:55,291 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:55,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:55,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-02-28 10:10:55,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:55,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:55,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:55,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:55,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-28 10:10:56,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:56,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:56,009 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:56,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:56,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:56,009 INFO 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-02-28 10:10:56,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:56,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:56,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-28 10:10:56,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:56,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 37 conjunts are in the unsatisfiable core [2019-02-28 10:10:56,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:56,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-28 10:10:56,392 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:57,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-28 10:10:57,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:57,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-02-28 10:10:57,841 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:57,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-28 10:10:57,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-28 10:10:57,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-28 10:10:57,842 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-02-28 10:10:57,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:57,983 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-02-28 10:10:57,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-28 10:10:57,984 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-02-28 10:10:57,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:57,985 INFO L225 Difference]: With dead ends: 115 [2019-02-28 10:10:57,985 INFO L226 Difference]: Without dead ends: 77 [2019-02-28 10:10:57,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-28 10:10:57,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-28 10:10:57,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-28 10:10:57,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-28 10:10:57,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-02-28 10:10:57,988 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-02-28 10:10:57,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:57,988 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-02-28 10:10:57,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-28 10:10:57,988 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-02-28 10:10:57,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-28 10:10:57,989 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:57,989 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-02-28 10:10:57,989 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:57,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:57,989 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-02-28 10:10:57,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:57,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:57,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:57,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:57,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:58,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-28 10:10:58,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:58,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:58,622 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:58,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:58,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:58,622 INFO 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-02-28 10:10:58,633 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:58,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:58,692 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:58,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:58,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 38 conjunts are in the unsatisfiable core [2019-02-28 10:10:58,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:58,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-28 10:10:58,706 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:00,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-28 10:11:00,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:00,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-02-28 10:11:00,485 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:00,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-28 10:11:00,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-28 10:11:00,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-28 10:11:00,486 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-02-28 10:11:00,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:00,631 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-02-28 10:11:00,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-28 10:11:00,632 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-02-28 10:11:00,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:00,633 INFO L225 Difference]: With dead ends: 118 [2019-02-28 10:11:00,633 INFO L226 Difference]: Without dead ends: 79 [2019-02-28 10:11:00,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-28 10:11:00,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-28 10:11:00,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-28 10:11:00,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-28 10:11:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-02-28 10:11:00,637 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-02-28 10:11:00,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:00,637 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-02-28 10:11:00,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-28 10:11:00,637 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-02-28 10:11:00,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-28 10:11:00,638 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:00,638 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-02-28 10:11:00,638 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:00,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:00,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-02-28 10:11:00,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:00,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:00,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:00,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:00,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:01,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-28 10:11:01,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:01,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:01,284 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:01,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:01,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:01,285 INFO 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-02-28 10:11:01,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:01,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:01,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 39 conjunts are in the unsatisfiable core [2019-02-28 10:11:01,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-28 10:11:01,360 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:03,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-28 10:11:03,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:03,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-02-28 10:11:03,060 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:03,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-28 10:11:03,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-28 10:11:03,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-28 10:11:03,061 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-02-28 10:11:03,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:03,208 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-02-28 10:11:03,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-28 10:11:03,209 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-02-28 10:11:03,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:03,210 INFO L225 Difference]: With dead ends: 121 [2019-02-28 10:11:03,210 INFO L226 Difference]: Without dead ends: 81 [2019-02-28 10:11:03,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-28 10:11:03,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-28 10:11:03,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-28 10:11:03,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-28 10:11:03,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-02-28 10:11:03,214 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-02-28 10:11:03,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:03,214 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-02-28 10:11:03,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-28 10:11:03,215 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-02-28 10:11:03,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-28 10:11:03,215 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:03,215 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-02-28 10:11:03,215 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:03,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:03,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-02-28 10:11:03,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:03,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:03,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:03,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:03,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-28 10:11:03,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:03,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:03,906 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:03,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:03,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:03,906 INFO 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-02-28 10:11:03,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:03,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:04,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-28 10:11:04,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:04,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-28 10:11:04,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:04,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-28 10:11:04,302 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-28 10:11:06,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:06,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-02-28 10:11:06,391 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:06,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-28 10:11:06,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-28 10:11:06,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-28 10:11:06,392 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-02-28 10:11:06,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:06,533 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-02-28 10:11:06,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-28 10:11:06,534 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-02-28 10:11:06,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:06,535 INFO L225 Difference]: With dead ends: 124 [2019-02-28 10:11:06,535 INFO L226 Difference]: Without dead ends: 83 [2019-02-28 10:11:06,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-28 10:11:06,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-28 10:11:06,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-28 10:11:06,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-28 10:11:06,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-02-28 10:11:06,537 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-02-28 10:11:06,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:06,538 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-02-28 10:11:06,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-28 10:11:06,538 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-02-28 10:11:06,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-28 10:11:06,538 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:06,538 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-02-28 10:11:06,538 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:06,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:06,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-02-28 10:11:06,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:06,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:06,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:06,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:06,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:07,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-28 10:11:07,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:07,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:07,255 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:07,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:07,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:07,255 INFO 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-02-28 10:11:07,264 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:07,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:07,321 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:07,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:07,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 41 conjunts are in the unsatisfiable core [2019-02-28 10:11:07,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-28 10:11:07,334 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:09,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-28 10:11:09,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:09,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-02-28 10:11:09,098 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:09,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-28 10:11:09,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-28 10:11:09,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-28 10:11:09,099 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-02-28 10:11:09,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:09,243 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-02-28 10:11:09,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-28 10:11:09,243 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-02-28 10:11:09,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:09,244 INFO L225 Difference]: With dead ends: 127 [2019-02-28 10:11:09,244 INFO L226 Difference]: Without dead ends: 85 [2019-02-28 10:11:09,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-28 10:11:09,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-28 10:11:09,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-28 10:11:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-28 10:11:09,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-02-28 10:11:09,248 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-02-28 10:11:09,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:09,248 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-02-28 10:11:09,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-28 10:11:09,248 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-02-28 10:11:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-28 10:11:09,249 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:09,249 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-02-28 10:11:09,249 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:09,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:09,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-02-28 10:11:09,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:09,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:09,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:09,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:09,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:10,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-28 10:11:10,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:10,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:10,692 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:10,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:10,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:10,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:11:10,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:10,701 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:10,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 42 conjunts are in the unsatisfiable core [2019-02-28 10:11:10,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:10,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-28 10:11:10,772 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-28 10:11:12,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:12,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-02-28 10:11:12,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:12,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-28 10:11:12,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-28 10:11:12,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-28 10:11:12,575 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-02-28 10:11:12,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:12,746 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-02-28 10:11:12,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-28 10:11:12,746 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-02-28 10:11:12,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:12,747 INFO L225 Difference]: With dead ends: 130 [2019-02-28 10:11:12,747 INFO L226 Difference]: Without dead ends: 87 [2019-02-28 10:11:12,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-28 10:11:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-28 10:11:12,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-28 10:11:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-28 10:11:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-02-28 10:11:12,751 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-02-28 10:11:12,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:12,751 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-02-28 10:11:12,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-28 10:11:12,751 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-02-28 10:11:12,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-28 10:11:12,752 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:12,752 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-02-28 10:11:12,752 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:12,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:12,753 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-02-28 10:11:12,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:12,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:12,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:12,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:12,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:13,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-28 10:11:13,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:13,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:13,739 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:13,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:13,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:13,740 INFO 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-02-28 10:11:13,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:13,749 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:14,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-28 10:11:14,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:14,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 43 conjunts are in the unsatisfiable core [2019-02-28 10:11:14,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-28 10:11:14,086 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-28 10:11:16,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:16,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-02-28 10:11:16,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:16,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-28 10:11:16,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-28 10:11:16,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:11:16,297 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-02-28 10:11:16,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:16,457 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-02-28 10:11:16,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-28 10:11:16,457 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-02-28 10:11:16,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:16,458 INFO L225 Difference]: With dead ends: 133 [2019-02-28 10:11:16,458 INFO L226 Difference]: Without dead ends: 89 [2019-02-28 10:11:16,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:11:16,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-28 10:11:16,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-28 10:11:16,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-28 10:11:16,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-02-28 10:11:16,462 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-02-28 10:11:16,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:16,462 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-02-28 10:11:16,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-28 10:11:16,463 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-02-28 10:11:16,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-28 10:11:16,463 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:16,463 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-02-28 10:11:16,463 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:16,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:16,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-02-28 10:11:16,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:16,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:16,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:16,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:16,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:18,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-28 10:11:18,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:18,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:18,179 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:18,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:18,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:18,180 INFO 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-02-28 10:11:18,188 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:18,189 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:18,250 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:18,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:18,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 44 conjunts are in the unsatisfiable core [2019-02-28 10:11:18,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-28 10:11:18,267 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-28 10:11:20,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:20,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-02-28 10:11:20,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:20,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-28 10:11:20,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-28 10:11:20,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-28 10:11:20,693 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-02-28 10:11:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:20,870 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-02-28 10:11:20,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-28 10:11:20,871 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-02-28 10:11:20,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:20,871 INFO L225 Difference]: With dead ends: 136 [2019-02-28 10:11:20,872 INFO L226 Difference]: Without dead ends: 91 [2019-02-28 10:11:20,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-28 10:11:20,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-28 10:11:20,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-28 10:11:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-28 10:11:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-02-28 10:11:20,875 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-02-28 10:11:20,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:20,876 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-02-28 10:11:20,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-28 10:11:20,876 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-02-28 10:11:20,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-28 10:11:20,876 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:20,877 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-02-28 10:11:20,877 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:20,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:20,877 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-02-28 10:11:20,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:20,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:20,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:20,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:20,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:21,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-28 10:11:21,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:21,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:21,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:21,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:21,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:21,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:11:21,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:21,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:21,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 45 conjunts are in the unsatisfiable core [2019-02-28 10:11:21,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:21,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-28 10:11:21,779 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-28 10:11:23,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:23,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-02-28 10:11:23,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:23,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-28 10:11:23,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-28 10:11:23,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-28 10:11:23,786 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-02-28 10:11:24,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:24,048 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-02-28 10:11:24,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-28 10:11:24,049 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-02-28 10:11:24,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:24,049 INFO L225 Difference]: With dead ends: 139 [2019-02-28 10:11:24,050 INFO L226 Difference]: Without dead ends: 93 [2019-02-28 10:11:24,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-28 10:11:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-28 10:11:24,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-28 10:11:24,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-28 10:11:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-02-28 10:11:24,053 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-02-28 10:11:24,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:24,053 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-02-28 10:11:24,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-28 10:11:24,053 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-02-28 10:11:24,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-28 10:11:24,053 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:24,053 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-02-28 10:11:24,054 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:24,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:24,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-02-28 10:11:24,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:24,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:24,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:24,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:24,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:24,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-28 10:11:24,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:24,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:24,970 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:24,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:24,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:24,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:11:24,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:24,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:25,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-28 10:11:25,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:25,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 46 conjunts are in the unsatisfiable core [2019-02-28 10:11:25,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-28 10:11:25,362 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:27,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-28 10:11:27,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:27,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-02-28 10:11:27,639 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:27,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-28 10:11:27,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-28 10:11:27,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-28 10:11:27,640 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-02-28 10:11:28,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:28,179 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-02-28 10:11:28,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-28 10:11:28,179 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-02-28 10:11:28,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:28,180 INFO L225 Difference]: With dead ends: 142 [2019-02-28 10:11:28,180 INFO L226 Difference]: Without dead ends: 95 [2019-02-28 10:11:28,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-28 10:11:28,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-28 10:11:28,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-28 10:11:28,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-28 10:11:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-02-28 10:11:28,183 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-02-28 10:11:28,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:28,184 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-02-28 10:11:28,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-28 10:11:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-02-28 10:11:28,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-28 10:11:28,184 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:28,185 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-02-28 10:11:28,185 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:28,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:28,185 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-02-28 10:11:28,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:28,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:28,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:28,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:28,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:29,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-28 10:11:29,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:29,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:29,077 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:29,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:29,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:29,077 INFO 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-02-28 10:11:29,098 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:29,098 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:29,180 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:29,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:29,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 47 conjunts are in the unsatisfiable core [2019-02-28 10:11:29,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:29,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-28 10:11:29,199 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-28 10:11:32,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:32,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-02-28 10:11:32,773 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:32,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-28 10:11:32,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-28 10:11:32,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:11:32,774 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-02-28 10:11:32,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:32,987 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-02-28 10:11:32,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-28 10:11:32,990 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-02-28 10:11:32,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:32,991 INFO L225 Difference]: With dead ends: 145 [2019-02-28 10:11:32,991 INFO L226 Difference]: Without dead ends: 97 [2019-02-28 10:11:32,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:11:32,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-28 10:11:32,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-28 10:11:32,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-28 10:11:32,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-02-28 10:11:32,995 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-02-28 10:11:32,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:32,995 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-02-28 10:11:32,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-28 10:11:32,995 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-02-28 10:11:32,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-28 10:11:32,996 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:32,996 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-02-28 10:11:32,996 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:32,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:32,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-02-28 10:11:32,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:32,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:32,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:32,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:32,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:34,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-28 10:11:34,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:34,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:34,030 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:34,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:34,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:34,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:11:34,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:34,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:34,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 48 conjunts are in the unsatisfiable core [2019-02-28 10:11:34,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:34,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-28 10:11:34,123 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:36,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-28 10:11:36,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:36,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-02-28 10:11:36,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:36,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-28 10:11:36,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-28 10:11:36,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-28 10:11:36,666 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-02-28 10:11:36,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:36,842 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-02-28 10:11:36,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-28 10:11:36,843 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-02-28 10:11:36,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:36,844 INFO L225 Difference]: With dead ends: 148 [2019-02-28 10:11:36,844 INFO L226 Difference]: Without dead ends: 99 [2019-02-28 10:11:36,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-28 10:11:36,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-28 10:11:36,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-28 10:11:36,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-28 10:11:36,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-02-28 10:11:36,847 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-02-28 10:11:36,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:36,847 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-02-28 10:11:36,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-28 10:11:36,847 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-02-28 10:11:36,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-28 10:11:36,848 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:36,848 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-02-28 10:11:36,848 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:36,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:36,848 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-02-28 10:11:36,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:36,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:36,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:36,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:36,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:38,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-28 10:11:38,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:38,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:38,028 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:38,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:38,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:38,028 INFO 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-02-28 10:11:38,037 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:38,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:38,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-28 10:11:38,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:38,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 49 conjunts are in the unsatisfiable core [2019-02-28 10:11:38,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-28 10:11:38,564 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:41,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-28 10:11:41,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:41,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-02-28 10:11:41,258 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:41,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-28 10:11:41,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-28 10:11:41,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-28 10:11:41,259 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-02-28 10:11:41,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:41,440 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-02-28 10:11:41,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-28 10:11:41,441 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-02-28 10:11:41,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:41,442 INFO L225 Difference]: With dead ends: 151 [2019-02-28 10:11:41,442 INFO L226 Difference]: Without dead ends: 101 [2019-02-28 10:11:41,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-28 10:11:41,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-28 10:11:41,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-02-28 10:11:41,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-28 10:11:41,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-02-28 10:11:41,445 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-02-28 10:11:41,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:41,446 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-02-28 10:11:41,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-28 10:11:41,446 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-02-28 10:11:41,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-28 10:11:41,446 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:41,446 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-02-28 10:11:41,447 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:41,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:41,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-02-28 10:11:41,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:41,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:41,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:41,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:41,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:42,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-28 10:11:42,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:42,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:42,459 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:42,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:42,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:42,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:11:42,467 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:42,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:42,536 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:42,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:42,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 50 conjunts are in the unsatisfiable core [2019-02-28 10:11:42,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-28 10:11:42,556 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-28 10:11:45,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:45,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-02-28 10:11:45,153 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:45,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-28 10:11:45,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-28 10:11:45,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-28 10:11:45,155 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-02-28 10:11:46,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:46,054 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-02-28 10:11:46,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-28 10:11:46,055 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-02-28 10:11:46,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:46,055 INFO L225 Difference]: With dead ends: 154 [2019-02-28 10:11:46,056 INFO L226 Difference]: Without dead ends: 103 [2019-02-28 10:11:46,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-28 10:11:46,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-28 10:11:46,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-02-28 10:11:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-28 10:11:46,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-02-28 10:11:46,061 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-02-28 10:11:46,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:46,061 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-02-28 10:11:46,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-28 10:11:46,061 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-02-28 10:11:46,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-28 10:11:46,062 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:46,062 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-02-28 10:11:46,062 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:46,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:46,063 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-02-28 10:11:46,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:46,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:46,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:46,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:46,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-28 10:11:48,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:48,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:48,750 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:48,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:48,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:48,750 INFO 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-02-28 10:11:48,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:48,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:48,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 51 conjunts are in the unsatisfiable core [2019-02-28 10:11:48,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-28 10:11:48,852 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-28 10:11:51,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:51,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-02-28 10:11:51,760 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:51,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-28 10:11:51,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-28 10:11:51,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-28 10:11:51,761 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-02-28 10:11:51,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:51,982 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-02-28 10:11:51,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-28 10:11:51,982 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-02-28 10:11:51,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:51,983 INFO L225 Difference]: With dead ends: 157 [2019-02-28 10:11:51,983 INFO L226 Difference]: Without dead ends: 105 [2019-02-28 10:11:51,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-28 10:11:51,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-28 10:11:51,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-02-28 10:11:51,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-28 10:11:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-02-28 10:11:51,987 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-02-28 10:11:51,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:51,987 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-02-28 10:11:51,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-28 10:11:51,988 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-02-28 10:11:51,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-28 10:11:51,988 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:51,988 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-02-28 10:11:51,989 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:51,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:51,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-02-28 10:11:51,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:51,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:51,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:51,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:51,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-28 10:11:53,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:53,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:53,549 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:53,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:53,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:53,549 INFO 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-02-28 10:11:53,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:53,560 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:54,732 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-28 10:11:54,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:54,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-28 10:11:54,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:54,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-28 10:11:54,758 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-28 10:11:58,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:58,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-02-28 10:11:58,009 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:58,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-28 10:11:58,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-28 10:11:58,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-28 10:11:58,010 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-02-28 10:11:58,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:58,886 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-02-28 10:11:58,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-28 10:11:58,887 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-02-28 10:11:58,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:58,888 INFO L225 Difference]: With dead ends: 160 [2019-02-28 10:11:58,888 INFO L226 Difference]: Without dead ends: 107 [2019-02-28 10:11:58,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-28 10:11:58,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-28 10:11:58,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-02-28 10:11:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-28 10:11:58,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-02-28 10:11:58,893 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-02-28 10:11:58,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:58,894 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-02-28 10:11:58,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-28 10:11:58,894 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-02-28 10:11:58,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-28 10:11:58,895 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:58,895 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-02-28 10:11:58,895 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:58,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:58,895 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-02-28 10:11:58,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:58,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:58,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:58,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:58,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:00,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-28 10:12:00,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:00,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:00,091 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:00,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:00,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:00,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:12:00,100 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:12:00,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:12:00,172 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:12:00,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:00,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 53 conjunts are in the unsatisfiable core [2019-02-28 10:12:00,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:00,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-28 10:12:00,189 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-28 10:12:03,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:03,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-02-28 10:12:03,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:03,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-28 10:12:03,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-28 10:12:03,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-28 10:12:03,264 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-02-28 10:12:03,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:03,472 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-02-28 10:12:03,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-28 10:12:03,473 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-02-28 10:12:03,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:03,473 INFO L225 Difference]: With dead ends: 163 [2019-02-28 10:12:03,473 INFO L226 Difference]: Without dead ends: 109 [2019-02-28 10:12:03,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-28 10:12:03,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-28 10:12:03,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-02-28 10:12:03,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-28 10:12:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-02-28 10:12:03,477 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-02-28 10:12:03,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:03,477 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-02-28 10:12:03,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-28 10:12:03,478 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-02-28 10:12:03,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-28 10:12:03,478 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:03,478 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-02-28 10:12:03,479 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:03,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:03,479 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-02-28 10:12:03,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:03,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:03,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:03,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:03,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-28 10:12:04,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:04,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:04,975 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:04,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:04,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:04,975 INFO 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-02-28 10:12:04,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:04,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:12:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:05,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 54 conjunts are in the unsatisfiable core [2019-02-28 10:12:05,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:05,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-28 10:12:05,073 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:08,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-28 10:12:08,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:08,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-02-28 10:12:08,204 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:08,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-28 10:12:08,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-28 10:12:08,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-28 10:12:08,206 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-02-28 10:12:08,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:08,432 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-02-28 10:12:08,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-28 10:12:08,433 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-02-28 10:12:08,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:08,434 INFO L225 Difference]: With dead ends: 166 [2019-02-28 10:12:08,434 INFO L226 Difference]: Without dead ends: 111 [2019-02-28 10:12:08,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-28 10:12:08,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-28 10:12:08,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-02-28 10:12:08,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-28 10:12:08,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-02-28 10:12:08,437 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-02-28 10:12:08,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:08,437 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-02-28 10:12:08,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-28 10:12:08,437 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-02-28 10:12:08,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-28 10:12:08,438 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:08,438 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-02-28 10:12:08,438 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:08,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:08,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-02-28 10:12:08,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:08,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:08,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:08,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:08,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-28 10:12:09,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:09,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:09,731 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:09,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:09,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:09,731 INFO 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-02-28 10:12:09,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:12:09,741 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:12:10,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-02-28 10:12:10,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:10,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-28 10:12:10,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:10,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-28 10:12:10,905 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:14,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-28 10:12:14,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:14,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-02-28 10:12:14,169 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:14,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-28 10:12:14,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-28 10:12:14,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-28 10:12:14,171 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2019-02-28 10:12:14,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:14,428 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2019-02-28 10:12:14,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-28 10:12:14,429 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-02-28 10:12:14,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:14,429 INFO L225 Difference]: With dead ends: 169 [2019-02-28 10:12:14,429 INFO L226 Difference]: Without dead ends: 113 [2019-02-28 10:12:14,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-28 10:12:14,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-28 10:12:14,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-02-28 10:12:14,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-28 10:12:14,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-02-28 10:12:14,432 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2019-02-28 10:12:14,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:14,433 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-02-28 10:12:14,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-28 10:12:14,433 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-02-28 10:12:14,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-02-28 10:12:14,434 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:14,434 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2019-02-28 10:12:14,434 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:14,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:14,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2019-02-28 10:12:14,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:14,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:14,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:14,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:14,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:16,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-02-28 10:12:16,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:16,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:16,004 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:16,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:16,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:16,005 INFO 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-02-28 10:12:16,014 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:12:16,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:12:16,090 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:12:16,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:16,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 56 conjunts are in the unsatisfiable core [2019-02-28 10:12:16,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-02-28 10:12:16,106 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:19,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-02-28 10:12:19,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:19,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-02-28 10:12:19,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:19,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-28 10:12:19,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-28 10:12:19,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-28 10:12:19,575 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2019-02-28 10:12:19,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:19,792 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2019-02-28 10:12:19,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-28 10:12:19,793 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-02-28 10:12:19,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:19,794 INFO L225 Difference]: With dead ends: 172 [2019-02-28 10:12:19,794 INFO L226 Difference]: Without dead ends: 115 [2019-02-28 10:12:19,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-28 10:12:19,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-28 10:12:19,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-02-28 10:12:19,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-28 10:12:19,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-02-28 10:12:19,798 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2019-02-28 10:12:19,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:19,798 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-02-28 10:12:19,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-28 10:12:19,798 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-02-28 10:12:19,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-28 10:12:19,799 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:19,799 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2019-02-28 10:12:19,799 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:19,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:19,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2019-02-28 10:12:19,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:19,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:19,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:19,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:19,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-02-28 10:12:21,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:21,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:21,195 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:21,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:21,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:21,195 INFO 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-02-28 10:12:21,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:21,205 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:12:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:21,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 57 conjunts are in the unsatisfiable core [2019-02-28 10:12:21,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:21,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-02-28 10:12:21,314 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:25,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-02-28 10:12:25,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:25,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-02-28 10:12:25,019 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:25,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-28 10:12:25,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-28 10:12:25,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-28 10:12:25,021 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2019-02-28 10:12:25,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:25,433 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2019-02-28 10:12:25,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-28 10:12:25,433 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2019-02-28 10:12:25,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:25,434 INFO L225 Difference]: With dead ends: 175 [2019-02-28 10:12:25,434 INFO L226 Difference]: Without dead ends: 117 [2019-02-28 10:12:25,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-28 10:12:25,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-28 10:12:25,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-02-28 10:12:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-28 10:12:25,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-02-28 10:12:25,438 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-02-28 10:12:25,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:25,438 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-02-28 10:12:25,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-28 10:12:25,438 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-02-28 10:12:25,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-02-28 10:12:25,439 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:25,439 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2019-02-28 10:12:25,439 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:25,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:25,439 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2019-02-28 10:12:25,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:25,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:25,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:25,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:25,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-02-28 10:12:26,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:26,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:26,656 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:26,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:26,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:26,656 INFO 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-02-28 10:12:26,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:12:26,666 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:12:27,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-28 10:12:27,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:27,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-28 10:12:27,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:27,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-02-28 10:12:27,495 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:30,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-02-28 10:12:30,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:30,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-02-28 10:12:30,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:30,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-28 10:12:30,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-28 10:12:30,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-28 10:12:30,991 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2019-02-28 10:12:31,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:31,296 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2019-02-28 10:12:31,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-28 10:12:31,296 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2019-02-28 10:12:31,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:31,297 INFO L225 Difference]: With dead ends: 178 [2019-02-28 10:12:31,297 INFO L226 Difference]: Without dead ends: 119 [2019-02-28 10:12:31,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-28 10:12:31,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-28 10:12:31,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-02-28 10:12:31,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-02-28 10:12:31,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-02-28 10:12:31,300 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2019-02-28 10:12:31,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:31,300 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-02-28 10:12:31,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-28 10:12:31,301 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-02-28 10:12:31,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-02-28 10:12:31,301 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:31,301 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2019-02-28 10:12:31,302 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:31,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:31,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2019-02-28 10:12:31,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:31,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:31,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:31,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:31,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:32,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-02-28 10:12:32,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:32,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:32,939 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:32,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:32,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:32,939 INFO 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-02-28 10:12:32,947 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:12:32,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:12:33,027 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:12:33,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:33,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 59 conjunts are in the unsatisfiable core [2019-02-28 10:12:33,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:33,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-02-28 10:12:33,067 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-02-28 10:12:36,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:36,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-02-28 10:12:36,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:36,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-28 10:12:36,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-28 10:12:36,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:12:36,559 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2019-02-28 10:12:36,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:36,827 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2019-02-28 10:12:36,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-28 10:12:36,827 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2019-02-28 10:12:36,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:36,828 INFO L225 Difference]: With dead ends: 181 [2019-02-28 10:12:36,828 INFO L226 Difference]: Without dead ends: 121 [2019-02-28 10:12:36,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:12:36,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-02-28 10:12:36,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-02-28 10:12:36,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-28 10:12:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-02-28 10:12:36,832 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2019-02-28 10:12:36,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:36,832 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-02-28 10:12:36,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-28 10:12:36,832 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-02-28 10:12:36,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-02-28 10:12:36,833 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:36,833 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2019-02-28 10:12:36,833 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:36,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:36,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2019-02-28 10:12:36,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:36,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:36,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:36,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:36,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-02-28 10:12:38,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:38,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:38,350 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:38,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:38,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:38,351 INFO 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-02-28 10:12:38,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:38,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:12:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:38,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 60 conjunts are in the unsatisfiable core [2019-02-28 10:12:38,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-02-28 10:12:38,460 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:42,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-02-28 10:12:42,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:42,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-02-28 10:12:42,129 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:42,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-02-28 10:12:42,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-02-28 10:12:42,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-28 10:12:42,131 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2019-02-28 10:12:42,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:42,517 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2019-02-28 10:12:42,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-28 10:12:42,518 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-02-28 10:12:42,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:42,518 INFO L225 Difference]: With dead ends: 184 [2019-02-28 10:12:42,518 INFO L226 Difference]: Without dead ends: 123 [2019-02-28 10:12:42,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-28 10:12:42,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-28 10:12:42,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-02-28 10:12:42,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-02-28 10:12:42,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-02-28 10:12:42,522 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-02-28 10:12:42,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:42,522 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-02-28 10:12:42,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-02-28 10:12:42,523 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-02-28 10:12:42,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-02-28 10:12:42,523 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:42,524 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2019-02-28 10:12:42,524 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:42,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:42,524 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2019-02-28 10:12:42,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:42,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:42,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:42,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:42,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:44,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-02-28 10:12:44,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:44,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:44,047 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:44,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:44,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:44,048 INFO 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-02-28 10:12:44,058 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:12:44,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:12:45,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-02-28 10:12:45,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:45,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 61 conjunts are in the unsatisfiable core [2019-02-28 10:12:45,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:45,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-02-28 10:12:45,163 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-02-28 10:12:49,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:49,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-02-28 10:12:49,261 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:49,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-28 10:12:49,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-28 10:12:49,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-28 10:12:49,262 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2019-02-28 10:12:49,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:49,593 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2019-02-28 10:12:49,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-28 10:12:49,594 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2019-02-28 10:12:49,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:49,594 INFO L225 Difference]: With dead ends: 187 [2019-02-28 10:12:49,594 INFO L226 Difference]: Without dead ends: 125 [2019-02-28 10:12:49,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-28 10:12:49,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-02-28 10:12:49,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-02-28 10:12:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-02-28 10:12:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-02-28 10:12:49,598 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2019-02-28 10:12:49,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:49,598 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-02-28 10:12:49,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-28 10:12:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-02-28 10:12:49,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-02-28 10:12:49,599 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:49,599 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2019-02-28 10:12:49,600 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:49,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:49,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2019-02-28 10:12:49,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:49,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:49,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:49,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:49,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:50,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-02-28 10:12:50,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:50,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:50,952 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:50,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:50,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:50,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:12:50,961 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:12:50,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:12:51,047 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:12:51,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:51,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 62 conjunts are in the unsatisfiable core [2019-02-28 10:12:51,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:51,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-02-28 10:12:51,069 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:55,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-02-28 10:12:55,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:55,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-02-28 10:12:55,181 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:55,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-02-28 10:12:55,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-02-28 10:12:55,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-28 10:12:55,182 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2019-02-28 10:12:55,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:55,443 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2019-02-28 10:12:55,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-28 10:12:55,444 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2019-02-28 10:12:55,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:55,445 INFO L225 Difference]: With dead ends: 190 [2019-02-28 10:12:55,445 INFO L226 Difference]: Without dead ends: 127 [2019-02-28 10:12:55,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-28 10:12:55,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-28 10:12:55,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-02-28 10:12:55,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-02-28 10:12:55,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-02-28 10:12:55,449 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2019-02-28 10:12:55,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:55,449 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-02-28 10:12:55,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-02-28 10:12:55,449 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-02-28 10:12:55,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-02-28 10:12:55,450 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:55,450 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2019-02-28 10:12:55,450 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:55,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:55,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2019-02-28 10:12:55,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:55,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:55,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:55,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:55,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-02-28 10:12:56,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:56,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:56,900 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:56,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:56,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:56,901 INFO 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-02-28 10:12:56,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:56,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:12:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:56,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 63 conjunts are in the unsatisfiable core [2019-02-28 10:12:56,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:57,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-02-28 10:12:57,014 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:01,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-02-28 10:13:01,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:01,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-02-28 10:13:01,285 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:01,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-28 10:13:01,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-28 10:13:01,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-28 10:13:01,286 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2019-02-28 10:13:01,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:01,633 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2019-02-28 10:13:01,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-28 10:13:01,633 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2019-02-28 10:13:01,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:01,634 INFO L225 Difference]: With dead ends: 193 [2019-02-28 10:13:01,634 INFO L226 Difference]: Without dead ends: 129 [2019-02-28 10:13:01,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-28 10:13:01,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-02-28 10:13:01,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-02-28 10:13:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-02-28 10:13:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-02-28 10:13:01,637 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-02-28 10:13:01,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:01,637 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-02-28 10:13:01,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-28 10:13:01,637 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-02-28 10:13:01,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-02-28 10:13:01,638 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:01,638 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2019-02-28 10:13:01,638 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:01,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:01,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2019-02-28 10:13:01,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:01,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:01,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:01,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:01,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-02-28 10:13:03,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:03,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:03,389 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:03,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:03,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:03,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 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-02-28 10:13:03,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:13:03,399 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:13:04,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-28 10:13:04,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:04,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 64 conjunts are in the unsatisfiable core [2019-02-28 10:13:04,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:04,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-02-28 10:13:04,414 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:08,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-02-28 10:13:08,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:08,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-02-28 10:13:08,658 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:08,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-28 10:13:08,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-28 10:13:08,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-28 10:13:08,659 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2019-02-28 10:13:09,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:09,025 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2019-02-28 10:13:09,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-28 10:13:09,025 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-02-28 10:13:09,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:09,026 INFO L225 Difference]: With dead ends: 196 [2019-02-28 10:13:09,026 INFO L226 Difference]: Without dead ends: 131 [2019-02-28 10:13:09,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-28 10:13:09,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-02-28 10:13:09,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-02-28 10:13:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-02-28 10:13:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-02-28 10:13:09,030 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2019-02-28 10:13:09,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:09,030 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-02-28 10:13:09,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-28 10:13:09,030 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-02-28 10:13:09,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-02-28 10:13:09,031 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:09,031 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2019-02-28 10:13:09,031 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:09,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:09,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2019-02-28 10:13:09,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:09,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:09,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:09,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:09,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:10,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-02-28 10:13:10,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:10,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:10,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:10,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:10,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:10,585 INFO 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-02-28 10:13:10,596 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:13:10,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:13:10,688 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:13:10,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:10,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 65 conjunts are in the unsatisfiable core [2019-02-28 10:13:10,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:10,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-02-28 10:13:10,708 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:15,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-02-28 10:13:15,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:15,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-02-28 10:13:15,109 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:15,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-28 10:13:15,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-28 10:13:15,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-28 10:13:15,110 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2019-02-28 10:13:15,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:15,482 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2019-02-28 10:13:15,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-28 10:13:15,482 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2019-02-28 10:13:15,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:15,483 INFO L225 Difference]: With dead ends: 199 [2019-02-28 10:13:15,483 INFO L226 Difference]: Without dead ends: 133 [2019-02-28 10:13:15,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-28 10:13:15,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-02-28 10:13:15,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-02-28 10:13:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-28 10:13:15,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-02-28 10:13:15,487 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2019-02-28 10:13:15,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:15,487 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-02-28 10:13:15,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-28 10:13:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-02-28 10:13:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-28 10:13:15,488 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:15,488 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2019-02-28 10:13:15,488 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:15,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:15,489 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2019-02-28 10:13:15,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:15,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:15,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:15,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:15,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-02-28 10:13:17,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:17,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:17,000 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:17,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:17,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:17,001 INFO 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-02-28 10:13:17,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:17,011 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:13:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:17,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 66 conjunts are in the unsatisfiable core [2019-02-28 10:13:17,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:17,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-02-28 10:13:17,116 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:21,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-02-28 10:13:21,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:21,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-02-28 10:13:21,793 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:21,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-02-28 10:13:21,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-02-28 10:13:21,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-28 10:13:21,794 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2019-02-28 10:13:22,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:22,213 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2019-02-28 10:13:22,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-28 10:13:22,213 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2019-02-28 10:13:22,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:22,214 INFO L225 Difference]: With dead ends: 202 [2019-02-28 10:13:22,214 INFO L226 Difference]: Without dead ends: 135 [2019-02-28 10:13:22,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-28 10:13:22,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-28 10:13:22,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-02-28 10:13:22,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-02-28 10:13:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-02-28 10:13:22,219 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-02-28 10:13:22,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:22,219 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-02-28 10:13:22,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-02-28 10:13:22,219 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-02-28 10:13:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-02-28 10:13:22,220 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:22,220 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2019-02-28 10:13:22,220 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:22,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:22,220 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2019-02-28 10:13:22,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:22,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:22,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:22,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:22,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:24,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-02-28 10:13:24,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:24,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:24,666 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:24,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:24,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:24,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:13:24,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:13:24,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:13:27,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-28 10:13:27,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:27,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 67 conjunts are in the unsatisfiable core [2019-02-28 10:13:27,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:27,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-02-28 10:13:27,653 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-02-28 10:13:32,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:32,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-02-28 10:13:32,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:32,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-28 10:13:32,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-28 10:13:32,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-28 10:13:32,354 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2019-02-28 10:13:32,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:32,688 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2019-02-28 10:13:32,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-28 10:13:32,689 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2019-02-28 10:13:32,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:32,689 INFO L225 Difference]: With dead ends: 205 [2019-02-28 10:13:32,689 INFO L226 Difference]: Without dead ends: 137 [2019-02-28 10:13:32,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-28 10:13:32,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-02-28 10:13:32,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-02-28 10:13:32,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-28 10:13:32,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-02-28 10:13:32,694 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2019-02-28 10:13:32,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:32,694 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-02-28 10:13:32,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-28 10:13:32,694 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-02-28 10:13:32,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-02-28 10:13:32,695 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:32,695 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2019-02-28 10:13:32,696 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:32,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:32,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2019-02-28 10:13:32,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:32,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:32,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:32,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:32,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:34,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-02-28 10:13:34,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:34,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:34,537 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:34,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:34,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:34,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:13:34,548 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:13:34,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:13:34,636 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:13:34,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:34,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 68 conjunts are in the unsatisfiable core [2019-02-28 10:13:34,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:34,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-02-28 10:13:34,666 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:40,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-02-28 10:13:40,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:40,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-02-28 10:13:40,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:40,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-02-28 10:13:40,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-02-28 10:13:40,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-28 10:13:40,169 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2019-02-28 10:13:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:40,601 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2019-02-28 10:13:40,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-28 10:13:40,601 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-02-28 10:13:40,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:40,602 INFO L225 Difference]: With dead ends: 208 [2019-02-28 10:13:40,602 INFO L226 Difference]: Without dead ends: 139 [2019-02-28 10:13:40,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-28 10:13:40,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-02-28 10:13:40,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-02-28 10:13:40,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-02-28 10:13:40,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-02-28 10:13:40,605 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2019-02-28 10:13:40,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:40,605 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-02-28 10:13:40,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-02-28 10:13:40,605 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-02-28 10:13:40,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-02-28 10:13:40,606 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:40,606 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2019-02-28 10:13:40,606 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:40,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:40,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2019-02-28 10:13:40,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:40,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:40,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:40,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:40,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-02-28 10:13:42,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:42,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:42,261 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:42,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:42,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:42,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:13:42,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:42,276 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:13:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:42,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 69 conjunts are in the unsatisfiable core [2019-02-28 10:13:42,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-02-28 10:13:42,389 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-02-28 10:13:47,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:47,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-02-28 10:13:47,238 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:47,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-28 10:13:47,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-28 10:13:47,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-28 10:13:47,239 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2019-02-28 10:13:47,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:47,690 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2019-02-28 10:13:47,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-28 10:13:47,690 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2019-02-28 10:13:47,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:47,691 INFO L225 Difference]: With dead ends: 211 [2019-02-28 10:13:47,691 INFO L226 Difference]: Without dead ends: 141 [2019-02-28 10:13:47,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-28 10:13:47,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-02-28 10:13:47,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-02-28 10:13:47,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-02-28 10:13:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-02-28 10:13:47,695 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-02-28 10:13:47,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:47,695 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-02-28 10:13:47,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-28 10:13:47,695 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-02-28 10:13:47,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-02-28 10:13:47,695 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:47,695 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2019-02-28 10:13:47,696 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:47,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:47,696 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2019-02-28 10:13:47,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:47,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:47,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:47,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:47,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-02-28 10:13:49,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:49,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:49,536 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:49,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:49,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:49,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:13:49,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:13:49,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:13:52,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-02-28 10:13:52,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:52,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 70 conjunts are in the unsatisfiable core [2019-02-28 10:13:52,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-02-28 10:13:52,796 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:57,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-02-28 10:13:57,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:57,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-02-28 10:13:57,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:57,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-28 10:13:57,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-28 10:13:57,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-28 10:13:57,833 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2019-02-28 10:13:58,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:58,301 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2019-02-28 10:13:58,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-28 10:13:58,302 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2019-02-28 10:13:58,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:58,302 INFO L225 Difference]: With dead ends: 214 [2019-02-28 10:13:58,302 INFO L226 Difference]: Without dead ends: 143 [2019-02-28 10:13:58,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-28 10:13:58,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-02-28 10:13:58,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-02-28 10:13:58,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-02-28 10:13:58,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-02-28 10:13:58,305 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2019-02-28 10:13:58,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:58,306 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-02-28 10:13:58,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-28 10:13:58,306 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-02-28 10:13:58,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-02-28 10:13:58,306 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:58,306 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2019-02-28 10:13:58,307 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:58,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:58,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2019-02-28 10:13:58,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:58,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:58,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:58,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:58,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:00,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-02-28 10:14:00,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:00,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:00,332 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:00,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:00,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:00,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:14:00,340 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:14:00,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:14:00,436 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:14:00,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:00,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 71 conjunts are in the unsatisfiable core [2019-02-28 10:14:00,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:00,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-02-28 10:14:00,455 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:05,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-02-28 10:14:05,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:05,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-02-28 10:14:05,654 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:05,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-28 10:14:05,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-28 10:14:05,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-28 10:14:05,656 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2019-02-28 10:14:06,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:06,112 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2019-02-28 10:14:06,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-28 10:14:06,112 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2019-02-28 10:14:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:06,113 INFO L225 Difference]: With dead ends: 217 [2019-02-28 10:14:06,113 INFO L226 Difference]: Without dead ends: 145 [2019-02-28 10:14:06,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-28 10:14:06,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-02-28 10:14:06,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-02-28 10:14:06,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-02-28 10:14:06,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-02-28 10:14:06,117 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2019-02-28 10:14:06,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:06,118 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-02-28 10:14:06,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-28 10:14:06,118 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-02-28 10:14:06,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-02-28 10:14:06,118 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:06,119 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2019-02-28 10:14:06,119 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:06,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:06,119 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2019-02-28 10:14:06,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:06,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:06,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:06,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:06,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:08,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-02-28 10:14:08,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:08,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:08,022 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:08,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:08,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:08,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:14:08,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:08,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:14:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:08,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 72 conjunts are in the unsatisfiable core [2019-02-28 10:14:08,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:08,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-02-28 10:14:08,147 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:13,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-02-28 10:14:13,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:13,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-02-28 10:14:13,537 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:13,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-02-28 10:14:13,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-02-28 10:14:13,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-28 10:14:13,539 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2019-02-28 10:14:13,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:13,963 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2019-02-28 10:14:13,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-28 10:14:13,964 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-02-28 10:14:13,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:13,965 INFO L225 Difference]: With dead ends: 220 [2019-02-28 10:14:13,965 INFO L226 Difference]: Without dead ends: 147 [2019-02-28 10:14:13,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-28 10:14:13,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-02-28 10:14:13,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-02-28 10:14:13,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-02-28 10:14:13,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-02-28 10:14:13,970 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-02-28 10:14:13,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:13,971 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-02-28 10:14:13,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-02-28 10:14:13,971 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-02-28 10:14:13,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-02-28 10:14:13,972 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:13,972 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2019-02-28 10:14:13,972 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:13,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:13,972 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2019-02-28 10:14:13,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:13,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:13,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:13,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:13,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-02-28 10:14:16,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:16,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:16,116 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:16,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:16,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:16,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:14:16,124 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:14:16,124 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:14:18,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-02-28 10:14:18,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:18,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 73 conjunts are in the unsatisfiable core [2019-02-28 10:14:18,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:18,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-02-28 10:14:18,766 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-02-28 10:14:24,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:24,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-02-28 10:14:24,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:24,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-28 10:14:24,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-28 10:14:24,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-28 10:14:24,238 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2019-02-28 10:14:24,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:24,780 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2019-02-28 10:14:24,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-28 10:14:24,781 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2019-02-28 10:14:24,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:24,782 INFO L225 Difference]: With dead ends: 223 [2019-02-28 10:14:24,782 INFO L226 Difference]: Without dead ends: 149 [2019-02-28 10:14:24,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-28 10:14:24,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-02-28 10:14:24,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-02-28 10:14:24,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-02-28 10:14:24,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-02-28 10:14:24,786 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2019-02-28 10:14:24,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:24,786 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-02-28 10:14:24,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-28 10:14:24,786 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-02-28 10:14:24,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-02-28 10:14:24,787 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:24,787 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2019-02-28 10:14:24,787 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:24,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:24,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2019-02-28 10:14:24,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:24,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:24,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:24,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:24,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:26,809 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-02-28 10:14:26,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:26,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:26,810 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:26,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:26,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:26,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:14:26,818 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:14:26,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:14:26,917 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:14:26,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:26,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 74 conjunts are in the unsatisfiable core [2019-02-28 10:14:26,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:26,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-02-28 10:14:26,948 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-02-28 10:14:32,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:32,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-02-28 10:14:32,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:32,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-28 10:14:32,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-28 10:14:32,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-28 10:14:32,658 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2019-02-28 10:14:33,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:33,151 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2019-02-28 10:14:33,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-28 10:14:33,152 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2019-02-28 10:14:33,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:33,153 INFO L225 Difference]: With dead ends: 226 [2019-02-28 10:14:33,153 INFO L226 Difference]: Without dead ends: 151 [2019-02-28 10:14:33,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-28 10:14:33,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-02-28 10:14:33,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-02-28 10:14:33,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-02-28 10:14:33,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-02-28 10:14:33,157 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2019-02-28 10:14:33,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:33,158 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-02-28 10:14:33,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-28 10:14:33,158 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-02-28 10:14:33,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-02-28 10:14:33,159 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:33,159 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2019-02-28 10:14:33,159 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:33,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:33,159 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2019-02-28 10:14:33,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:33,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:33,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:33,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:33,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-02-28 10:14:35,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:35,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:35,505 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:35,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:35,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:35,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:14:35,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:35,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:14:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:35,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 75 conjunts are in the unsatisfiable core [2019-02-28 10:14:35,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:35,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-02-28 10:14:35,641 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-02-28 10:14:41,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:41,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-02-28 10:14:41,446 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:41,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-28 10:14:41,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-28 10:14:41,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-28 10:14:41,448 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2019-02-28 10:14:41,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:41,942 INFO L93 Difference]: Finished difference Result 229 states and 232 transitions. [2019-02-28 10:14:41,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-28 10:14:41,943 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2019-02-28 10:14:41,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:41,944 INFO L225 Difference]: With dead ends: 229 [2019-02-28 10:14:41,944 INFO L226 Difference]: Without dead ends: 153 [2019-02-28 10:14:41,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-28 10:14:41,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-02-28 10:14:41,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-02-28 10:14:41,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-02-28 10:14:41,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-02-28 10:14:41,948 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-02-28 10:14:41,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:41,949 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-02-28 10:14:41,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-28 10:14:41,949 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-02-28 10:14:41,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-02-28 10:14:41,950 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:41,950 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2019-02-28 10:14:41,950 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:41,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:41,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2019-02-28 10:14:41,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:41,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:41,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:41,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:41,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:43,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-02-28 10:14:43,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:43,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:43,932 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:43,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:43,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:43,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:14:43,940 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:14:43,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:14:46,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-28 10:14:46,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:46,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 76 conjunts are in the unsatisfiable core [2019-02-28 10:14:46,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:46,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-02-28 10:14:46,098 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:52,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-02-28 10:14:52,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:52,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-02-28 10:14:52,102 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:52,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-28 10:14:52,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-28 10:14:52,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-28 10:14:52,103 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2019-02-28 10:14:52,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:52,674 INFO L93 Difference]: Finished difference Result 232 states and 235 transitions. [2019-02-28 10:14:52,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-28 10:14:52,674 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2019-02-28 10:14:52,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:52,675 INFO L225 Difference]: With dead ends: 232 [2019-02-28 10:14:52,675 INFO L226 Difference]: Without dead ends: 155 [2019-02-28 10:14:52,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-28 10:14:52,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-02-28 10:14:52,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-02-28 10:14:52,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-02-28 10:14:52,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-02-28 10:14:52,679 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2019-02-28 10:14:52,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:52,679 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-02-28 10:14:52,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-28 10:14:52,679 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-02-28 10:14:52,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-02-28 10:14:52,680 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:52,680 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2019-02-28 10:14:52,680 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:52,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:52,680 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2019-02-28 10:14:52,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:52,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:52,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:52,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:52,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:54,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-02-28 10:14:54,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:54,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:54,777 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:54,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:54,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:54,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:14:54,786 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:14:54,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:14:54,892 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:14:54,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:54,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 77 conjunts are in the unsatisfiable core [2019-02-28 10:14:54,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:54,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-02-28 10:14:54,915 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-02-28 10:15:01,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:01,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-02-28 10:15:01,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:01,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-28 10:15:01,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-28 10:15:01,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-28 10:15:01,426 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2019-02-28 10:15:02,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:02,049 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2019-02-28 10:15:02,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-28 10:15:02,050 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2019-02-28 10:15:02,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:02,051 INFO L225 Difference]: With dead ends: 235 [2019-02-28 10:15:02,051 INFO L226 Difference]: Without dead ends: 157 [2019-02-28 10:15:02,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-28 10:15:02,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-02-28 10:15:02,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-02-28 10:15:02,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-28 10:15:02,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-02-28 10:15:02,055 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2019-02-28 10:15:02,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:02,055 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-02-28 10:15:02,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-28 10:15:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-02-28 10:15:02,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-28 10:15:02,056 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:02,056 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2019-02-28 10:15:02,057 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:02,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:02,057 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2019-02-28 10:15:02,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:02,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:02,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:15:02,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:02,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-02-28 10:15:04,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:04,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:04,214 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:04,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:04,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:04,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:15:04,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:04,223 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:15:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:04,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 78 conjunts are in the unsatisfiable core [2019-02-28 10:15:04,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:04,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-02-28 10:15:04,351 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:10,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-02-28 10:15:10,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:10,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-02-28 10:15:10,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:10,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-02-28 10:15:10,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-02-28 10:15:10,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-28 10:15:10,707 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2019-02-28 10:15:11,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:11,336 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2019-02-28 10:15:11,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-28 10:15:11,336 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2019-02-28 10:15:11,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:11,337 INFO L225 Difference]: With dead ends: 238 [2019-02-28 10:15:11,337 INFO L226 Difference]: Without dead ends: 159 [2019-02-28 10:15:11,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-28 10:15:11,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-28 10:15:11,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-02-28 10:15:11,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-02-28 10:15:11,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-02-28 10:15:11,341 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-02-28 10:15:11,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:11,342 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-02-28 10:15:11,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-02-28 10:15:11,342 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-02-28 10:15:11,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-02-28 10:15:11,342 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:11,342 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2019-02-28 10:15:11,343 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:11,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:11,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2019-02-28 10:15:11,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:11,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:11,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:11,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:11,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-02-28 10:15:13,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:13,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:13,547 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:13,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:13,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:13,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:15:13,556 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:15:13,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:15:17,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-02-28 10:15:17,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:15:17,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 79 conjunts are in the unsatisfiable core [2019-02-28 10:15:17,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-02-28 10:15:17,880 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-02-28 10:15:24,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:24,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-02-28 10:15:24,419 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:24,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-28 10:15:24,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-28 10:15:24,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-28 10:15:24,420 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2019-02-28 10:15:25,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:25,071 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2019-02-28 10:15:25,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-28 10:15:25,071 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2019-02-28 10:15:25,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:25,072 INFO L225 Difference]: With dead ends: 241 [2019-02-28 10:15:25,072 INFO L226 Difference]: Without dead ends: 161 [2019-02-28 10:15:25,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-28 10:15:25,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-02-28 10:15:25,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-02-28 10:15:25,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-28 10:15:25,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-02-28 10:15:25,077 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2019-02-28 10:15:25,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:25,077 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-02-28 10:15:25,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-28 10:15:25,077 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-02-28 10:15:25,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-28 10:15:25,078 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:25,078 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2019-02-28 10:15:25,078 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:25,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:25,079 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2019-02-28 10:15:25,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:25,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:25,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:15:25,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:25,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:27,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-02-28 10:15:27,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:27,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:27,608 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:27,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:27,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:27,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:15:27,617 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:15:27,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:15:27,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:15:27,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:15:27,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 80 conjunts are in the unsatisfiable core [2019-02-28 10:15:27,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:27,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-02-28 10:15:27,748 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:34,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-02-28 10:15:34,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:34,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-02-28 10:15:34,367 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:34,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-02-28 10:15:34,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-02-28 10:15:34,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-28 10:15:34,369 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2019-02-28 10:15:35,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:35,084 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2019-02-28 10:15:35,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-28 10:15:35,084 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2019-02-28 10:15:35,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:35,085 INFO L225 Difference]: With dead ends: 244 [2019-02-28 10:15:35,085 INFO L226 Difference]: Without dead ends: 163 [2019-02-28 10:15:35,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-28 10:15:35,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-02-28 10:15:35,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-02-28 10:15:35,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-02-28 10:15:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-02-28 10:15:35,090 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2019-02-28 10:15:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:35,090 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-02-28 10:15:35,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-02-28 10:15:35,090 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-02-28 10:15:35,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-02-28 10:15:35,091 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:35,091 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2019-02-28 10:15:35,091 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:35,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:35,092 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2019-02-28 10:15:35,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:35,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:35,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:15:35,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:35,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:37,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-02-28 10:15:37,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:37,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:37,644 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:37,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:37,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:37,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:15:37,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:37,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:15:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:37,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 81 conjunts are in the unsatisfiable core [2019-02-28 10:15:37,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:37,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-02-28 10:15:37,786 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:44,535 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-02-28 10:15:44,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:44,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-02-28 10:15:44,554 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:44,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-28 10:15:44,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-28 10:15:44,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-28 10:15:44,555 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2019-02-28 10:15:45,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:45,297 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2019-02-28 10:15:45,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-28 10:15:45,297 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2019-02-28 10:15:45,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:45,298 INFO L225 Difference]: With dead ends: 247 [2019-02-28 10:15:45,298 INFO L226 Difference]: Without dead ends: 165 [2019-02-28 10:15:45,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-28 10:15:45,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-02-28 10:15:45,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-02-28 10:15:45,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-02-28 10:15:45,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-02-28 10:15:45,302 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-02-28 10:15:45,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:45,302 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-02-28 10:15:45,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-28 10:15:45,303 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-02-28 10:15:45,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-02-28 10:15:45,303 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:45,304 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2019-02-28 10:15:45,304 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:45,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:45,304 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2019-02-28 10:15:45,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:45,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:45,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:45,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:45,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:47,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-02-28 10:15:47,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:47,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:47,920 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:47,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:47,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:47,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:15:47,929 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:15:47,929 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:15:50,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-02-28 10:15:50,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:15:50,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 82 conjunts are in the unsatisfiable core [2019-02-28 10:15:50,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-02-28 10:15:50,987 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-02-28 10:15:58,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:58,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-02-28 10:15:58,274 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:58,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-28 10:15:58,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-28 10:15:58,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-28 10:15:58,276 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2019-02-28 10:15:58,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:58,992 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2019-02-28 10:15:58,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-28 10:15:58,992 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2019-02-28 10:15:58,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:58,993 INFO L225 Difference]: With dead ends: 250 [2019-02-28 10:15:58,993 INFO L226 Difference]: Without dead ends: 167 [2019-02-28 10:15:58,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-28 10:15:58,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-02-28 10:15:58,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-02-28 10:15:58,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-02-28 10:15:58,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-02-28 10:15:58,996 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2019-02-28 10:15:58,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:58,996 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-02-28 10:15:58,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-28 10:15:58,997 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-02-28 10:15:58,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-02-28 10:15:58,997 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:58,997 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2019-02-28 10:15:58,997 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:58,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:58,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2019-02-28 10:15:58,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:58,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:58,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:15:58,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:58,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-02-28 10:16:01,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:01,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:01,496 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:01,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:01,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:01,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:16:01,505 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:16:01,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:16:01,626 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:16:01,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:16:01,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 83 conjunts are in the unsatisfiable core [2019-02-28 10:16:01,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-02-28 10:16:01,652 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-02-28 10:16:09,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:09,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-02-28 10:16:09,015 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:09,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-28 10:16:09,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-28 10:16:09,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:16:09,016 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2019-02-28 10:16:09,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:09,610 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2019-02-28 10:16:09,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-28 10:16:09,610 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2019-02-28 10:16:09,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:09,611 INFO L225 Difference]: With dead ends: 253 [2019-02-28 10:16:09,611 INFO L226 Difference]: Without dead ends: 169 [2019-02-28 10:16:09,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:16:09,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-02-28 10:16:09,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-02-28 10:16:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-02-28 10:16:09,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-02-28 10:16:09,615 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2019-02-28 10:16:09,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:09,616 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-02-28 10:16:09,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-28 10:16:09,616 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-02-28 10:16:09,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-02-28 10:16:09,616 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:09,616 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2019-02-28 10:16:09,617 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:09,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:09,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2019-02-28 10:16:09,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:09,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:09,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:16:09,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:09,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:12,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-02-28 10:16:12,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:12,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:12,380 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:12,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:12,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:12,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:16:12,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:16:12,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:16:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:12,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 84 conjunts are in the unsatisfiable core [2019-02-28 10:16:12,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:12,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-02-28 10:16:12,527 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:19,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-02-28 10:16:19,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:19,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-02-28 10:16:19,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:19,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-02-28 10:16:19,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-02-28 10:16:19,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-28 10:16:19,832 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2019-02-28 10:16:20,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:20,620 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2019-02-28 10:16:20,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-28 10:16:20,620 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2019-02-28 10:16:20,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:20,621 INFO L225 Difference]: With dead ends: 256 [2019-02-28 10:16:20,621 INFO L226 Difference]: Without dead ends: 171 [2019-02-28 10:16:20,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-28 10:16:20,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-02-28 10:16:20,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-02-28 10:16:20,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-02-28 10:16:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2019-02-28 10:16:20,624 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2019-02-28 10:16:20,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:20,625 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2019-02-28 10:16:20,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-02-28 10:16:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2019-02-28 10:16:20,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-02-28 10:16:20,625 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:20,626 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2019-02-28 10:16:20,626 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:20,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:20,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2019-02-28 10:16:20,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:20,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:20,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:16:20,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:20,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-02-28 10:16:23,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:23,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:23,469 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:23,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:23,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:23,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:16:23,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:16:23,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:16:32,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-02-28 10:16:32,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:16:32,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 85 conjunts are in the unsatisfiable core [2019-02-28 10:16:32,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-02-28 10:16:32,223 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:40,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-02-28 10:16:40,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:40,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-02-28 10:16:40,038 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:40,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-28 10:16:40,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-28 10:16:40,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-28 10:16:40,041 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2019-02-28 10:16:40,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:40,875 INFO L93 Difference]: Finished difference Result 259 states and 262 transitions. [2019-02-28 10:16:40,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-28 10:16:40,875 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2019-02-28 10:16:40,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:40,876 INFO L225 Difference]: With dead ends: 259 [2019-02-28 10:16:40,876 INFO L226 Difference]: Without dead ends: 173 [2019-02-28 10:16:40,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-28 10:16:40,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-28 10:16:40,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-02-28 10:16:40,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-02-28 10:16:40,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2019-02-28 10:16:40,880 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2019-02-28 10:16:40,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:40,880 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2019-02-28 10:16:40,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-28 10:16:40,880 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2019-02-28 10:16:40,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-02-28 10:16:40,881 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:40,881 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2019-02-28 10:16:40,881 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:40,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:40,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2019-02-28 10:16:40,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:40,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:40,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:16:40,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:40,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:43,702 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-02-28 10:16:43,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:43,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:43,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:43,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:43,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:43,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:16:43,711 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:16:43,711 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:16:43,827 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:16:43,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:16:43,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 86 conjunts are in the unsatisfiable core [2019-02-28 10:16:43,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:43,854 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-02-28 10:16:43,854 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:51,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-02-28 10:16:51,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:51,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-02-28 10:16:51,483 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:51,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-02-28 10:16:51,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-02-28 10:16:51,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-28 10:16:51,484 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2019-02-28 10:16:52,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:52,353 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2019-02-28 10:16:52,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-28 10:16:52,354 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2019-02-28 10:16:52,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:52,354 INFO L225 Difference]: With dead ends: 262 [2019-02-28 10:16:52,355 INFO L226 Difference]: Without dead ends: 175 [2019-02-28 10:16:52,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-28 10:16:52,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-02-28 10:16:52,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-02-28 10:16:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-02-28 10:16:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-02-28 10:16:52,359 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2019-02-28 10:16:52,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:52,359 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-02-28 10:16:52,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-02-28 10:16:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-02-28 10:16:52,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-02-28 10:16:52,360 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:52,360 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2019-02-28 10:16:52,361 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:52,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:52,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2019-02-28 10:16:52,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:52,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:52,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:16:52,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:52,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-02-28 10:16:55,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:55,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:55,333 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:55,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:55,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:55,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:16:55,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:16:55,345 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:16:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:55,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 87 conjunts are in the unsatisfiable core [2019-02-28 10:16:55,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-02-28 10:16:55,485 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:17:03,582 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-02-28 10:17:03,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:17:03,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-02-28 10:17:03,600 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:17:03,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-28 10:17:03,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-28 10:17:03,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-28 10:17:03,603 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2019-02-28 10:17:04,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:04,482 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2019-02-28 10:17:04,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-28 10:17:04,483 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2019-02-28 10:17:04,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:04,484 INFO L225 Difference]: With dead ends: 265 [2019-02-28 10:17:04,484 INFO L226 Difference]: Without dead ends: 177 [2019-02-28 10:17:04,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-28 10:17:04,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-02-28 10:17:04,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-02-28 10:17:04,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-02-28 10:17:04,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-02-28 10:17:04,489 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2019-02-28 10:17:04,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:04,489 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-02-28 10:17:04,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-28 10:17:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-02-28 10:17:04,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-02-28 10:17:04,490 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:04,490 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2019-02-28 10:17:04,490 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:17:04,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:04,491 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2019-02-28 10:17:04,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:04,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:04,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:17:04,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:04,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:07,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-02-28 10:17:07,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:07,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:17:07,192 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:17:07,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:17:07,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:07,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:17:07,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:17:07,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:17:16,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-02-28 10:17:16,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:17:16,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 88 conjunts are in the unsatisfiable core [2019-02-28 10:17:16,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-02-28 10:17:16,410 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:17:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-02-28 10:17:24,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:17:24,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-02-28 10:17:24,637 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:17:24,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-28 10:17:24,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-28 10:17:24,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-28 10:17:24,639 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2019-02-28 10:17:25,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:25,376 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2019-02-28 10:17:25,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-28 10:17:25,377 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2019-02-28 10:17:25,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:25,378 INFO L225 Difference]: With dead ends: 268 [2019-02-28 10:17:25,378 INFO L226 Difference]: Without dead ends: 179 [2019-02-28 10:17:25,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-28 10:17:25,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-02-28 10:17:25,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-02-28 10:17:25,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-02-28 10:17:25,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-02-28 10:17:25,383 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2019-02-28 10:17:25,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:25,384 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-02-28 10:17:25,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-28 10:17:25,384 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-02-28 10:17:25,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-02-28 10:17:25,384 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:25,385 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2019-02-28 10:17:25,385 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:17:25,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:25,385 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2019-02-28 10:17:25,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:25,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:25,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:17:25,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:25,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-02-28 10:17:28,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:28,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:17:28,211 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:17:28,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:17:28,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:28,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:17:28,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:17:28,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:17:28,341 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:17:28,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:17:28,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 89 conjunts are in the unsatisfiable core [2019-02-28 10:17:28,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-02-28 10:17:28,370 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:17:37,115 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-02-28 10:17:37,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:17:37,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-02-28 10:17:37,134 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:17:37,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-28 10:17:37,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-28 10:17:37,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-28 10:17:37,137 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2019-02-28 10:17:38,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:38,105 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2019-02-28 10:17:38,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-28 10:17:38,105 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2019-02-28 10:17:38,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:38,106 INFO L225 Difference]: With dead ends: 271 [2019-02-28 10:17:38,106 INFO L226 Difference]: Without dead ends: 181 [2019-02-28 10:17:38,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-28 10:17:38,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-02-28 10:17:38,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-02-28 10:17:38,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-28 10:17:38,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2019-02-28 10:17:38,110 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2019-02-28 10:17:38,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:38,110 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2019-02-28 10:17:38,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-28 10:17:38,110 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2019-02-28 10:17:38,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-02-28 10:17:38,111 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:38,111 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2019-02-28 10:17:38,111 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:17:38,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:38,111 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2019-02-28 10:17:38,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:38,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:38,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:17:38,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:38,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-02-28 10:17:41,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:41,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:17:41,153 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:17:41,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:17:41,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:41,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:17:41,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:17:41,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:17:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:41,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 90 conjunts are in the unsatisfiable core [2019-02-28 10:17:41,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:41,309 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-02-28 10:17:41,309 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:17:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-02-28 10:17:49,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:17:49,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-02-28 10:17:49,792 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:17:49,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-28 10:17:49,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-28 10:17:49,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-28 10:17:49,794 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2019-02-28 10:17:50,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:50,608 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-02-28 10:17:50,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-28 10:17:50,609 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2019-02-28 10:17:50,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:50,610 INFO L225 Difference]: With dead ends: 274 [2019-02-28 10:17:50,610 INFO L226 Difference]: Without dead ends: 183 [2019-02-28 10:17:50,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-28 10:17:50,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-02-28 10:17:50,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-02-28 10:17:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-02-28 10:17:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-02-28 10:17:50,614 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2019-02-28 10:17:50,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:50,614 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-02-28 10:17:50,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-28 10:17:50,614 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-02-28 10:17:50,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-02-28 10:17:50,614 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:50,615 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2019-02-28 10:17:50,615 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:17:50,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:50,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2019-02-28 10:17:50,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:50,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:50,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:17:50,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:50,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-02-28 10:17:53,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:53,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:17:53,445 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:17:53,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:17:53,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:53,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:17:53,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:17:53,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:17:58,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-02-28 10:17:58,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:17:58,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-28 10:17:58,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:58,179 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-02-28 10:17:58,179 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:06,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-02-28 10:18:06,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:06,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-02-28 10:18:06,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:06,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-28 10:18:06,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-28 10:18:06,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-28 10:18:06,988 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2019-02-28 10:18:07,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:07,755 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2019-02-28 10:18:07,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-28 10:18:07,756 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2019-02-28 10:18:07,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:07,757 INFO L225 Difference]: With dead ends: 277 [2019-02-28 10:18:07,757 INFO L226 Difference]: Without dead ends: 185 [2019-02-28 10:18:07,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-28 10:18:07,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-02-28 10:18:07,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-02-28 10:18:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-28 10:18:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-02-28 10:18:07,761 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2019-02-28 10:18:07,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:07,761 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-02-28 10:18:07,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-28 10:18:07,761 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-02-28 10:18:07,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-02-28 10:18:07,762 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:07,762 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2019-02-28 10:18:07,762 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:18:07,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:07,762 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2019-02-28 10:18:07,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:07,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:07,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:18:07,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:07,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:10,927 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-02-28 10:18:10,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:10,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:18:10,928 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:18:10,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:18:10,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:10,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:18:10,940 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:18:10,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:18:11,067 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:18:11,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:18:11,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 92 conjunts are in the unsatisfiable core [2019-02-28 10:18:11,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:18:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-02-28 10:18:11,096 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:19,845 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-02-28 10:18:19,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:19,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-02-28 10:18:19,865 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:19,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-02-28 10:18:19,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-02-28 10:18:19,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-28 10:18:19,868 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2019-02-28 10:18:20,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:20,730 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2019-02-28 10:18:20,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-28 10:18:20,731 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2019-02-28 10:18:20,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:20,731 INFO L225 Difference]: With dead ends: 280 [2019-02-28 10:18:20,731 INFO L226 Difference]: Without dead ends: 187 [2019-02-28 10:18:20,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-28 10:18:20,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-02-28 10:18:20,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-02-28 10:18:20,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-02-28 10:18:20,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-02-28 10:18:20,736 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2019-02-28 10:18:20,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:20,737 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2019-02-28 10:18:20,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-02-28 10:18:20,737 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2019-02-28 10:18:20,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-02-28 10:18:20,738 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:20,738 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2019-02-28 10:18:20,738 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:18:20,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:20,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2019-02-28 10:18:20,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:20,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:20,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:18:20,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:20,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:23,752 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-02-28 10:18:23,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:23,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:18:23,753 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:18:23,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:18:23,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:23,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:18:23,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:18:23,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:18:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:23,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 93 conjunts are in the unsatisfiable core [2019-02-28 10:18:23,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:18:23,917 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-02-28 10:18:23,917 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:33,149 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-02-28 10:18:33,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:33,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-02-28 10:18:33,168 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:33,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-28 10:18:33,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-28 10:18:33,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-28 10:18:33,170 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2019-02-28 10:18:34,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:34,234 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2019-02-28 10:18:34,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-28 10:18:34,234 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2019-02-28 10:18:34,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:34,235 INFO L225 Difference]: With dead ends: 283 [2019-02-28 10:18:34,235 INFO L226 Difference]: Without dead ends: 189 [2019-02-28 10:18:34,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-28 10:18:34,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-02-28 10:18:34,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-02-28 10:18:34,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-02-28 10:18:34,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2019-02-28 10:18:34,239 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2019-02-28 10:18:34,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:34,240 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2019-02-28 10:18:34,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-28 10:18:34,240 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2019-02-28 10:18:34,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-02-28 10:18:34,241 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:34,241 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2019-02-28 10:18:34,241 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:18:34,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:34,241 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2019-02-28 10:18:34,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:34,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:34,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:18:34,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:34,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-02-28 10:18:37,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:37,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:18:37,545 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:18:37,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:18:37,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:37,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:18:37,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:18:37,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:18:42,799 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-02-28 10:18:42,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:18:42,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 94 conjunts are in the unsatisfiable core [2019-02-28 10:18:42,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:18:42,857 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-02-28 10:18:42,857 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:52,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-02-28 10:18:52,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:52,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-02-28 10:18:52,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:52,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-28 10:18:52,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-28 10:18:52,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-28 10:18:52,067 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2019-02-28 10:18:52,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:52,993 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-02-28 10:18:52,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-28 10:18:52,993 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2019-02-28 10:18:52,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:52,994 INFO L225 Difference]: With dead ends: 286 [2019-02-28 10:18:52,994 INFO L226 Difference]: Without dead ends: 191 [2019-02-28 10:18:52,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-28 10:18:52,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-02-28 10:18:52,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-02-28 10:18:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-02-28 10:18:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-02-28 10:18:52,998 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2019-02-28 10:18:52,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:52,998 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-02-28 10:18:52,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-28 10:18:52,998 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-02-28 10:18:52,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-02-28 10:18:52,999 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:52,999 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2019-02-28 10:18:52,999 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:18:52,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:53,000 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2019-02-28 10:18:53,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:53,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:53,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:18:53,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:53,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-02-28 10:18:56,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:56,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:18:56,356 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:18:56,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:18:56,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:56,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:18:56,365 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:18:56,365 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:18:56,496 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:18:56,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:18:56,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 95 conjunts are in the unsatisfiable core [2019-02-28 10:18:56,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:18:56,527 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-02-28 10:18:56,527 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:19:05,785 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-02-28 10:19:05,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:19:05,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-02-28 10:19:05,804 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:19:05,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-28 10:19:05,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-28 10:19:05,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-28 10:19:05,806 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2019-02-28 10:19:06,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:19:06,896 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2019-02-28 10:19:06,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-28 10:19:06,896 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2019-02-28 10:19:06,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:19:06,897 INFO L225 Difference]: With dead ends: 289 [2019-02-28 10:19:06,897 INFO L226 Difference]: Without dead ends: 193 [2019-02-28 10:19:06,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-28 10:19:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-02-28 10:19:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-02-28 10:19:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-02-28 10:19:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-02-28 10:19:06,901 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2019-02-28 10:19:06,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:19:06,901 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-02-28 10:19:06,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-28 10:19:06,901 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-02-28 10:19:06,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-02-28 10:19:06,901 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:19:06,902 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2019-02-28 10:19:06,902 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:19:06,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:19:06,902 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2019-02-28 10:19:06,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:19:06,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:06,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:19:06,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:06,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:19:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-02-28 10:19:10,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:10,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:10,143 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:10,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:10,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:10,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:19:10,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:19:10,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:19:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:10,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 96 conjunts are in the unsatisfiable core [2019-02-28 10:19:10,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-02-28 10:19:10,314 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:19:19,776 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-02-28 10:19:19,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:19:19,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-02-28 10:19:19,796 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:19:19,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-02-28 10:19:19,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-02-28 10:19:19,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-28 10:19:19,798 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2019-02-28 10:19:20,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:19:20,960 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2019-02-28 10:19:20,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-28 10:19:20,960 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2019-02-28 10:19:20,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:19:20,961 INFO L225 Difference]: With dead ends: 292 [2019-02-28 10:19:20,961 INFO L226 Difference]: Without dead ends: 195 [2019-02-28 10:19:20,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-28 10:19:20,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-02-28 10:19:20,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-02-28 10:19:20,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-02-28 10:19:20,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2019-02-28 10:19:20,965 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2019-02-28 10:19:20,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:19:20,965 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2019-02-28 10:19:20,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-02-28 10:19:20,965 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2019-02-28 10:19:20,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-02-28 10:19:20,966 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:19:20,966 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2019-02-28 10:19:20,966 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:19:20,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:19:20,966 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2019-02-28 10:19:20,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:19:20,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:20,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:19:20,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:20,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:19:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:24,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-02-28 10:19:24,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:24,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:24,512 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:24,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:24,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:24,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:19:24,520 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:19:24,521 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:19:30,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-02-28 10:19:30,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:19:30,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 97 conjunts are in the unsatisfiable core [2019-02-28 10:19:30,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:30,650 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-02-28 10:19:30,650 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:19:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-02-28 10:19:40,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:19:40,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-02-28 10:19:40,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:19:40,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-28 10:19:40,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-28 10:19:40,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-28 10:19:40,432 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2019-02-28 10:19:41,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:19:41,737 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-02-28 10:19:41,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-28 10:19:41,738 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2019-02-28 10:19:41,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:19:41,738 INFO L225 Difference]: With dead ends: 295 [2019-02-28 10:19:41,738 INFO L226 Difference]: Without dead ends: 197 [2019-02-28 10:19:41,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-28 10:19:41,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-02-28 10:19:41,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-02-28 10:19:41,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-02-28 10:19:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2019-02-28 10:19:41,743 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2019-02-28 10:19:41,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:19:41,743 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2019-02-28 10:19:41,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-28 10:19:41,743 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2019-02-28 10:19:41,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-02-28 10:19:41,744 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:19:41,744 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2019-02-28 10:19:41,745 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:19:41,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:19:41,745 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2019-02-28 10:19:41,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:19:41,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:41,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:19:41,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:41,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:19:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-02-28 10:19:45,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:45,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:45,247 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:45,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:45,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:45,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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:19:45,257 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:19:45,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:19:45,388 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:19:45,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:19:45,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 98 conjunts are in the unsatisfiable core [2019-02-28 10:19:45,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:45,421 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-02-28 10:19:45,421 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:19:55,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-02-28 10:19:55,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:19:55,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-02-28 10:19:55,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:19:55,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-02-28 10:19:55,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-02-28 10:19:55,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-28 10:19:55,549 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2019-02-28 10:19:56,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:19:56,883 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2019-02-28 10:19:56,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-28 10:19:56,883 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2019-02-28 10:19:56,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:19:56,884 INFO L225 Difference]: With dead ends: 298 [2019-02-28 10:19:56,884 INFO L226 Difference]: Without dead ends: 199 [2019-02-28 10:19:56,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-28 10:19:56,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-02-28 10:19:56,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-02-28 10:19:56,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-02-28 10:19:56,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-02-28 10:19:56,888 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2019-02-28 10:19:56,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:19:56,888 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-02-28 10:19:56,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-02-28 10:19:56,888 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-02-28 10:19:56,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-02-28 10:19:56,889 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:19:56,889 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2019-02-28 10:19:56,889 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:19:56,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:19:56,890 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2019-02-28 10:19:56,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:19:56,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:56,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:19:56,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:56,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:19:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-02-28 10:20:00,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:00,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:20:00,570 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:20:00,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:20:00,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:00,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:20:00,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:20:00,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:20:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:00,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 99 conjunts are in the unsatisfiable core [2019-02-28 10:20:00,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:20:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-02-28 10:20:00,744 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:20:11,301 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-02-28 10:20:11,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:20:11,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-02-28 10:20:11,320 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:20:11,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-28 10:20:11,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-28 10:20:11,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-28 10:20:11,322 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2019-02-28 10:20:12,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:20:12,394 INFO L93 Difference]: Finished difference Result 301 states and 304 transitions. [2019-02-28 10:20:12,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-28 10:20:12,394 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2019-02-28 10:20:12,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:20:12,395 INFO L225 Difference]: With dead ends: 301 [2019-02-28 10:20:12,395 INFO L226 Difference]: Without dead ends: 201 [2019-02-28 10:20:12,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-28 10:20:12,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-02-28 10:20:12,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-02-28 10:20:12,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-02-28 10:20:12,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-02-28 10:20:12,400 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2019-02-28 10:20:12,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:20:12,400 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-02-28 10:20:12,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-28 10:20:12,401 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-02-28 10:20:12,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-02-28 10:20:12,401 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:20:12,401 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2019-02-28 10:20:12,401 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:20:12,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:20:12,402 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2019-02-28 10:20:12,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:20:12,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:12,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:20:12,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:12,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:20:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:16,260 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-02-28 10:20:16,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:16,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:20:16,261 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:20:16,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:20:16,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:16,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:20:16,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:20:16,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:20:30,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-02-28 10:20:30,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:20:31,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 100 conjunts are in the unsatisfiable core [2019-02-28 10:20:31,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:20:31,057 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-02-28 10:20:31,057 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:20:41,467 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-02-28 10:20:41,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:20:41,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-02-28 10:20:41,497 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:20:41,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-28 10:20:41,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-28 10:20:41,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-28 10:20:41,499 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2019-02-28 10:20:42,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:20:42,902 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2019-02-28 10:20:42,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-28 10:20:42,902 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2019-02-28 10:20:42,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:20:42,903 INFO L225 Difference]: With dead ends: 304 [2019-02-28 10:20:42,903 INFO L226 Difference]: Without dead ends: 203 [2019-02-28 10:20:42,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-28 10:20:42,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-02-28 10:20:42,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-02-28 10:20:42,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-02-28 10:20:42,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2019-02-28 10:20:42,906 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2019-02-28 10:20:42,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:20:42,907 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2019-02-28 10:20:42,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-28 10:20:42,907 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2019-02-28 10:20:42,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-02-28 10:20:42,907 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:20:42,908 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2019-02-28 10:20:42,908 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:20:42,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:20:42,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2019-02-28 10:20:42,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:20:42,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:42,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:20:42,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:42,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:20:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:46,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-02-28 10:20:46,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:46,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:20:46,534 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:20:46,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:20:46,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:46,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:20:46,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:20:46,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:20:46,681 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:20:46,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:20:46,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 101 conjunts are in the unsatisfiable core [2019-02-28 10:20:46,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:20:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-02-28 10:20:46,718 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:20:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-02-28 10:20:57,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:20:57,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-02-28 10:20:57,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:20:57,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-28 10:20:57,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-28 10:20:57,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-28 10:20:57,438 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2019-02-28 10:20:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:20:58,857 INFO L93 Difference]: Finished difference Result 307 states and 310 transitions. [2019-02-28 10:20:58,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-02-28 10:20:58,857 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2019-02-28 10:20:58,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:20:58,858 INFO L225 Difference]: With dead ends: 307 [2019-02-28 10:20:58,858 INFO L226 Difference]: Without dead ends: 205 [2019-02-28 10:20:58,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-28 10:20:58,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-02-28 10:20:58,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-02-28 10:20:58,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-02-28 10:20:58,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-02-28 10:20:58,863 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2019-02-28 10:20:58,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:20:58,863 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-02-28 10:20:58,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-28 10:20:58,863 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-02-28 10:20:58,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-02-28 10:20:58,864 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:20:58,864 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2019-02-28 10:20:58,864 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:20:58,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:20:58,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2019-02-28 10:20:58,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:20:58,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:58,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:20:58,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:58,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:20:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:02,476 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-02-28 10:21:02,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:02,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:21:02,476 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:21:02,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:21:02,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:02,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:21:02,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:21:02,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:21:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:02,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 102 conjunts are in the unsatisfiable core [2019-02-28 10:21:02,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:21:02,671 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-02-28 10:21:02,671 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:21:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-02-28 10:21:13,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:21:13,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-02-28 10:21:13,690 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:21:13,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-28 10:21:13,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-28 10:21:13,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-28 10:21:13,692 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2019-02-28 10:21:15,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:21:15,029 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2019-02-28 10:21:15,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-28 10:21:15,029 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2019-02-28 10:21:15,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:21:15,030 INFO L225 Difference]: With dead ends: 310 [2019-02-28 10:21:15,030 INFO L226 Difference]: Without dead ends: 207 [2019-02-28 10:21:15,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-28 10:21:15,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-02-28 10:21:15,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-02-28 10:21:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-02-28 10:21:15,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-02-28 10:21:15,036 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2019-02-28 10:21:15,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:21:15,036 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-02-28 10:21:15,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-28 10:21:15,036 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-02-28 10:21:15,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-02-28 10:21:15,037 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:21:15,037 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2019-02-28 10:21:15,038 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:21:15,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:21:15,038 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2019-02-28 10:21:15,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:21:15,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:15,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:21:15,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:15,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:21:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:18,632 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-02-28 10:21:18,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:18,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:21:18,633 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:21:18,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:21:18,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:18,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 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:21:18,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:21:18,643 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:21:37,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-02-28 10:21:37,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:21:37,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 103 conjunts are in the unsatisfiable core [2019-02-28 10:21:37,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:21:37,345 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-02-28 10:21:37,345 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:21:48,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-02-28 10:21:48,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:21:48,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-02-28 10:21:48,461 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:21:48,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-28 10:21:48,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-28 10:21:48,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-28 10:21:48,464 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2019-02-28 10:21:50,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:21:50,072 INFO L93 Difference]: Finished difference Result 313 states and 316 transitions. [2019-02-28 10:21:50,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-02-28 10:21:50,072 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2019-02-28 10:21:50,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:21:50,073 INFO L225 Difference]: With dead ends: 313 [2019-02-28 10:21:50,073 INFO L226 Difference]: Without dead ends: 209 [2019-02-28 10:21:50,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-28 10:21:50,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-02-28 10:21:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-02-28 10:21:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-02-28 10:21:50,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-02-28 10:21:50,080 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2019-02-28 10:21:50,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:21:50,080 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-02-28 10:21:50,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-28 10:21:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-02-28 10:21:50,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-02-28 10:21:50,081 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:21:50,082 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1] [2019-02-28 10:21:50,082 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:21:50,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:21:50,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1650876630, now seen corresponding path program 102 times [2019-02-28 10:21:50,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:21:50,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:50,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:21:50,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:50,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:21:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:53,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-02-28 10:21:53,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:53,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:21:53,848 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:21:53,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:21:53,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:53,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:21:53,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:21:53,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:21:53,998 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:21:53,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:21:54,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 104 conjunts are in the unsatisfiable core [2019-02-28 10:21:54,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:21:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-02-28 10:21:54,034 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-02-28 10:22:05,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:05,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-02-28 10:22:05,321 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:05,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-28 10:22:05,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-28 10:22:05,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-28 10:22:05,324 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2019-02-28 10:22:06,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:06,681 INFO L93 Difference]: Finished difference Result 316 states and 319 transitions. [2019-02-28 10:22:06,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-02-28 10:22:06,682 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2019-02-28 10:22:06,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:06,682 INFO L225 Difference]: With dead ends: 316 [2019-02-28 10:22:06,682 INFO L226 Difference]: Without dead ends: 211 [2019-02-28 10:22:06,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-28 10:22:06,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-02-28 10:22:06,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-02-28 10:22:06,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-02-28 10:22:06,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2019-02-28 10:22:06,688 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2019-02-28 10:22:06,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:06,688 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2019-02-28 10:22:06,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-28 10:22:06,689 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2019-02-28 10:22:06,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-02-28 10:22:06,690 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:06,690 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1] [2019-02-28 10:22:06,690 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:06,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:06,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1160939221, now seen corresponding path program 103 times [2019-02-28 10:22:06,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:06,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:06,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:22:06,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:06,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-02-28 10:22:10,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:10,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:10,706 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:22:10,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:22:10,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:10,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:10,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:10,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:10,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 105 conjunts are in the unsatisfiable core [2019-02-28 10:22:10,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-02-28 10:22:10,894 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:22,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-02-28 10:22:22,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:22,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-02-28 10:22:22,252 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:22,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-28 10:22:22,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-28 10:22:22,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-28 10:22:22,255 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 106 states. [2019-02-28 10:22:23,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:23,755 INFO L93 Difference]: Finished difference Result 319 states and 322 transitions. [2019-02-28 10:22:23,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-02-28 10:22:23,756 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2019-02-28 10:22:23,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:23,757 INFO L225 Difference]: With dead ends: 319 [2019-02-28 10:22:23,757 INFO L226 Difference]: Without dead ends: 213 [2019-02-28 10:22:23,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-28 10:22:23,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-02-28 10:22:23,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-02-28 10:22:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-28 10:22:23,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2019-02-28 10:22:23,763 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2019-02-28 10:22:23,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:23,763 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2019-02-28 10:22:23,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-28 10:22:23,763 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2019-02-28 10:22:23,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-02-28 10:22:23,764 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:23,764 INFO L402 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1] [2019-02-28 10:22:23,764 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:23,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:23,765 INFO L82 PathProgramCache]: Analyzing trace with hash 193908298, now seen corresponding path program 104 times [2019-02-28 10:22:23,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:23,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:23,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:23,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:23,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:28,040 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-02-28 10:22:28,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:28,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:28,041 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:22:28,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:22:28,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:28,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:28,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:22:28,050 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:22:36,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-02-28 10:22:36,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:22:36,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 1055 conjuncts, 106 conjunts are in the unsatisfiable core [2019-02-28 10:22:36,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-02-28 10:22:36,590 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:48,226 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-02-28 10:22:48,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:48,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-02-28 10:22:48,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:48,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-28 10:22:48,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-28 10:22:48,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-28 10:22:48,258 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 107 states. [2019-02-28 10:22:49,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:49,575 INFO L93 Difference]: Finished difference Result 322 states and 325 transitions. [2019-02-28 10:22:49,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-02-28 10:22:49,575 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2019-02-28 10:22:49,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:49,576 INFO L225 Difference]: With dead ends: 322 [2019-02-28 10:22:49,576 INFO L226 Difference]: Without dead ends: 215 [2019-02-28 10:22:49,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-28 10:22:49,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-28 10:22:49,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-02-28 10:22:49,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-02-28 10:22:49,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2019-02-28 10:22:49,581 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 212 [2019-02-28 10:22:49,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:49,581 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2019-02-28 10:22:49,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-28 10:22:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2019-02-28 10:22:49,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-02-28 10:22:49,582 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:49,583 INFO L402 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1, 1] [2019-02-28 10:22:49,583 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:49,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:49,583 INFO L82 PathProgramCache]: Analyzing trace with hash 913063733, now seen corresponding path program 105 times [2019-02-28 10:22:49,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:49,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:49,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:22:49,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:49,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:53,785 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2019-02-28 10:22:53,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:53,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:53,785 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:22:53,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:22:53,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:53,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 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:53,794 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:22:53,794 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:22:53,940 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:22:53,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:22:53,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 1065 conjuncts, 107 conjunts are in the unsatisfiable core [2019-02-28 10:22:53,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:53,977 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2019-02-28 10:22:53,977 INFO L322 TraceCheckSpWp]: Computing backward predicates...