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_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:38:07,347 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:38:07,349 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:38:07,366 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:38:07,366 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:38:07,367 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:38:07,368 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:38:07,370 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:38:07,372 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:38:07,373 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:38:07,374 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:38:07,374 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:38:07,375 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:38:07,376 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:38:07,377 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:38:07,378 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:38:07,378 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:38:07,381 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:38:07,383 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:38:07,385 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:38:07,386 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:38:07,393 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:38:07,396 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:38:07,396 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:38:07,396 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:38:07,397 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:38:07,398 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:38:07,401 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:38:07,402 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:38:07,404 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:38:07,404 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:38:07,405 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:38:07,406 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:38:07,406 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:38:07,407 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:38:07,407 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:38:07,408 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-25 15:38:07,431 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:38:07,432 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:38:07,433 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:38:07,433 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:38:07,433 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:38:07,433 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:38:07,434 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:38:07,434 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:38:07,434 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:38:07,434 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-25 15:38:07,435 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-25 15:38:07,435 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:38:07,435 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:38:07,436 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:38:07,436 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:38:07,436 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:38:07,436 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:38:07,436 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:38:07,437 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:38:07,438 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:38:07,438 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:38:07,438 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:38:07,438 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:38:07,438 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:38:07,439 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:38:07,439 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:38:07,439 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:38:07,439 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:38:07,439 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:38:07,440 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:38:07,440 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:38:07,440 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:38:07,441 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:38:07,441 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:38:07,441 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:38:07,441 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:38:07,441 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:38:07,441 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:38:07,442 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:38:07,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:38:07,514 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:38:07,520 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:38:07,522 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:38:07,523 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:38:07,524 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2019-02-25 15:38:07,524 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2019-02-25 15:38:07,570 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:38:07,572 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:38:07,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:38:07,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:38:07,573 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:38:07,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:38:07" (1/1) ... [2019-02-25 15:38:07,605 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:38:07" (1/1) ... [2019-02-25 15:38:07,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:38:07,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:38:07,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:38:07,620 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:38:07,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:38:07" (1/1) ... [2019-02-25 15:38:07,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:38:07" (1/1) ... [2019-02-25 15:38:07,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:38:07" (1/1) ... [2019-02-25 15:38:07,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:38:07" (1/1) ... [2019-02-25 15:38:07,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:38:07" (1/1) ... [2019-02-25 15:38:07,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:38:07" (1/1) ... [2019-02-25 15:38:07,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:38:07" (1/1) ... [2019-02-25 15:38:07,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:38:07,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:38:07,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:38:07,652 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:38:07,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:38:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:38:07,735 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-02-25 15:38:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:38:07,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:38:07,949 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:38:07,949 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-02-25 15:38:07,951 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:38:07 BoogieIcfgContainer [2019-02-25 15:38:07,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:38:07,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:38:07,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:38:07,957 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:38:07,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:38:07" (1/2) ... [2019-02-25 15:38:07,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769585d6 and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:38:07, skipping insertion in model container [2019-02-25 15:38:07,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:38:07" (2/2) ... [2019-02-25 15:38:07,963 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2019-02-25 15:38:07,974 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:38:07,984 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-25 15:38:08,007 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-25 15:38:08,039 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:38:08,039 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:38:08,040 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:38:08,040 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:38:08,040 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:38:08,040 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:38:08,040 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:38:08,040 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:38:08,057 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-02-25 15:38:08,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:38:08,064 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:08,065 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:38:08,067 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:08,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:08,074 INFO L82 PathProgramCache]: Analyzing trace with hash 900035954, now seen corresponding path program 1 times [2019-02-25 15:38:08,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:08,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:08,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:08,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:08,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:08,310 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-25 15:38:08,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:38:08,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-25 15:38:08,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:38:08,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:38:08,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:38:08,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:38:08,342 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2019-02-25 15:38:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:08,515 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-02-25 15:38:08,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:38:08,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-25 15:38:08,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:08,530 INFO L225 Difference]: With dead ends: 26 [2019-02-25 15:38:08,531 INFO L226 Difference]: Without dead ends: 13 [2019-02-25 15:38:08,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-25 15:38:08,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-25 15:38:08,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-02-25 15:38:08,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-25 15:38:08,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-02-25 15:38:08,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 6 [2019-02-25 15:38:08,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:08,571 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-02-25 15:38:08,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:38:08,572 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-02-25 15:38:08,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:38:08,572 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:08,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:38:08,573 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:08,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:08,574 INFO L82 PathProgramCache]: Analyzing trace with hash 429804648, now seen corresponding path program 1 times [2019-02-25 15:38:08,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:08,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:08,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:08,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:08,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:08,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:38:08,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-02-25 15:38:08,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:38:08,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:38:08,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:38:08,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:38:08,682 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2019-02-25 15:38:08,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:08,800 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-02-25 15:38:08,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:38:08,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-02-25 15:38:08,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:08,802 INFO L225 Difference]: With dead ends: 25 [2019-02-25 15:38:08,802 INFO L226 Difference]: Without dead ends: 23 [2019-02-25 15:38:08,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-25 15:38:08,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-25 15:38:08,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-02-25 15:38:08,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-25 15:38:08,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-02-25 15:38:08,810 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2019-02-25 15:38:08,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:08,827 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-02-25 15:38:08,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:38:08,830 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2019-02-25 15:38:08,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:38:08,831 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:08,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:38:08,831 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:08,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:08,832 INFO L82 PathProgramCache]: Analyzing trace with hash 429806570, now seen corresponding path program 1 times [2019-02-25 15:38:08,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:08,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:08,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:08,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:08,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:08,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:38:08,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:38:08,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-25 15:38:08,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:38:08,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:38:08,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:38:08,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:38:08,886 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2019-02-25 15:38:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:08,908 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-02-25 15:38:08,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:38:08,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-02-25 15:38:08,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:08,909 INFO L225 Difference]: With dead ends: 24 [2019-02-25 15:38:08,909 INFO L226 Difference]: Without dead ends: 13 [2019-02-25 15:38:08,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:38:08,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-25 15:38:08,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-02-25 15:38:08,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-25 15:38:08,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-02-25 15:38:08,914 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2019-02-25 15:38:08,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:08,914 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-02-25 15:38:08,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:38:08,915 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-02-25 15:38:08,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:38:08,915 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:08,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:38:08,915 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:08,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:08,916 INFO L82 PathProgramCache]: Analyzing trace with hash -2090155286, now seen corresponding path program 1 times [2019-02-25 15:38:08,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:08,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:08,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:08,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:08,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:09,321 WARN L181 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-02-25 15:38:09,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:09,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:09,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:09,381 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-25 15:38:09,383 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [26], [27] [2019-02-25 15:38:09,443 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:38:09,444 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:38:09,710 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:38:09,713 INFO L272 AbstractInterpreter]: Visited 9 different actions 46 times. Merged at 8 different actions 36 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:38:09,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:09,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:38:09,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:09,729 INFO 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-25 15:38:09,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:09,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:09,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-25 15:38:09,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:09,885 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:10,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:10,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2019-02-25 15:38:10,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:10,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:38:10,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:38:10,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:38:10,033 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-02-25 15:38:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:10,288 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-02-25 15:38:10,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:38:10,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-02-25 15:38:10,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:10,292 INFO L225 Difference]: With dead ends: 26 [2019-02-25 15:38:10,292 INFO L226 Difference]: Without dead ends: 19 [2019-02-25 15:38:10,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:38:10,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-25 15:38:10,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-02-25 15:38:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-25 15:38:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-02-25 15:38:10,299 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-02-25 15:38:10,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:10,299 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-02-25 15:38:10,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:38:10,299 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-02-25 15:38:10,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-02-25 15:38:10,300 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:10,300 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:38:10,300 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:10,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:10,301 INFO L82 PathProgramCache]: Analyzing trace with hash -368470767, now seen corresponding path program 1 times [2019-02-25 15:38:10,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:10,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:10,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:10,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:10,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:10,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:10,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:10,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:10,388 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-02-25 15:38:10,388 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [22], [26], [27], [30], [32] [2019-02-25 15:38:10,394 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:38:10,395 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:38:10,577 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:38:10,580 INFO L272 AbstractInterpreter]: Visited 12 different actions 101 times. Merged at 11 different actions 73 times. Widened at 3 different actions 7 times. Found 18 fixpoints after 6 different actions. Largest state had 0 variables. [2019-02-25 15:38:10,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:10,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:38:10,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:10,581 INFO 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-25 15:38:10,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:10,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:10,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-25 15:38:10,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:10,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:10,716 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:10,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:10,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:10,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2019-02-25 15:38:10,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:10,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:38:10,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:38:10,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:38:10,778 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2019-02-25 15:38:11,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:11,217 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-02-25 15:38:11,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:38:11,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-02-25 15:38:11,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:11,219 INFO L225 Difference]: With dead ends: 31 [2019-02-25 15:38:11,219 INFO L226 Difference]: Without dead ends: 19 [2019-02-25 15:38:11,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:38:11,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-25 15:38:11,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-02-25 15:38:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-25 15:38:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-02-25 15:38:11,225 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-02-25 15:38:11,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:11,225 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-02-25 15:38:11,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:38:11,226 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-02-25 15:38:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-25 15:38:11,226 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:11,226 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:38:11,227 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:11,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:11,227 INFO L82 PathProgramCache]: Analyzing trace with hash -256855911, now seen corresponding path program 2 times [2019-02-25 15:38:11,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:11,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:11,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:11,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:11,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:11,593 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:11,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:11,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:11,594 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:11,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:11,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:11,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:38:11,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:38:11,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:38:11,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:38:11,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:11,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:38:11,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:11,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:11,738 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:11,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:11,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:11,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2019-02-25 15:38:11,800 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:11,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:38:11,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:38:11,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:38:11,801 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2019-02-25 15:38:12,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:12,090 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-02-25 15:38:12,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:38:12,091 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-02-25 15:38:12,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:12,092 INFO L225 Difference]: With dead ends: 35 [2019-02-25 15:38:12,092 INFO L226 Difference]: Without dead ends: 28 [2019-02-25 15:38:12,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:38:12,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-25 15:38:12,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-02-25 15:38:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-25 15:38:12,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-02-25 15:38:12,097 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-02-25 15:38:12,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:12,098 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-02-25 15:38:12,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:38:12,098 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-02-25 15:38:12,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-25 15:38:12,099 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:12,099 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-02-25 15:38:12,099 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:12,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:12,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1110643520, now seen corresponding path program 3 times [2019-02-25 15:38:12,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:12,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:12,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:12,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:12,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:12,227 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:12,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:12,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:12,228 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:12,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:12,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:12,228 INFO 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-25 15:38:12,237 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:38:12,238 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:38:12,244 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:38:12,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:12,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:38:12,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:12,303 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:12,303 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:12,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:12,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2019-02-25 15:38:12,356 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:12,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:38:12,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:38:12,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:38:12,357 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2019-02-25 15:38:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:12,472 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-02-25 15:38:12,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:38:12,473 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-02-25 15:38:12,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:12,474 INFO L225 Difference]: With dead ends: 45 [2019-02-25 15:38:12,474 INFO L226 Difference]: Without dead ends: 26 [2019-02-25 15:38:12,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:38:12,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-25 15:38:12,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-02-25 15:38:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-25 15:38:12,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-02-25 15:38:12,480 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2019-02-25 15:38:12,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:12,481 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-02-25 15:38:12,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:38:12,481 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-02-25 15:38:12,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-25 15:38:12,482 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:12,482 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-02-25 15:38:12,482 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:12,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:12,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1324912968, now seen corresponding path program 4 times [2019-02-25 15:38:12,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:12,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:12,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:12,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:12,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:12,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:12,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:12,726 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:12,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:12,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:12,726 INFO 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-25 15:38:12,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:12,736 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:12,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:38:12,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:12,856 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:12,857 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:12,895 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:12,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:12,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2019-02-25 15:38:12,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:12,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-25 15:38:12,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-25 15:38:12,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:38:12,917 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2019-02-25 15:38:13,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:13,284 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-02-25 15:38:13,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-25 15:38:13,289 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-02-25 15:38:13,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:13,290 INFO L225 Difference]: With dead ends: 49 [2019-02-25 15:38:13,290 INFO L226 Difference]: Without dead ends: 39 [2019-02-25 15:38:13,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:38:13,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-25 15:38:13,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-02-25 15:38:13,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-25 15:38:13,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-02-25 15:38:13,297 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-02-25 15:38:13,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:13,297 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-02-25 15:38:13,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-25 15:38:13,297 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-02-25 15:38:13,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-25 15:38:13,298 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:13,298 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-02-25 15:38:13,299 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:13,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:13,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1588570591, now seen corresponding path program 5 times [2019-02-25 15:38:13,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:13,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:13,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:13,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:13,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:13,407 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:13,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:13,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:13,408 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:13,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:13,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:13,408 INFO 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-25 15:38:13,419 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:38:13,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:38:13,462 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-25 15:38:13,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:13,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:38:13,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:13,555 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:13,662 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:13,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:13,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2019-02-25 15:38:13,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:13,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-25 15:38:13,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-25 15:38:13,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:38:13,695 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2019-02-25 15:38:14,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:14,299 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-02-25 15:38:14,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:38:14,299 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-02-25 15:38:14,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:14,301 INFO L225 Difference]: With dead ends: 60 [2019-02-25 15:38:14,301 INFO L226 Difference]: Without dead ends: 33 [2019-02-25 15:38:14,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:38:14,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-25 15:38:14,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-02-25 15:38:14,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-25 15:38:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-02-25 15:38:14,308 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-02-25 15:38:14,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:14,308 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-02-25 15:38:14,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-25 15:38:14,308 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-02-25 15:38:14,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-25 15:38:14,309 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:14,309 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-02-25 15:38:14,310 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:14,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:14,310 INFO L82 PathProgramCache]: Analyzing trace with hash 366737255, now seen corresponding path program 6 times [2019-02-25 15:38:14,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:14,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:14,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:14,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:14,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:14,670 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:14,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:14,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:14,671 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:14,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:14,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:14,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:38:14,680 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:38:14,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:38:14,688 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:38:14,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:14,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:38:14,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:14,856 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:14,911 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:14,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:14,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2019-02-25 15:38:14,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:14,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-25 15:38:14,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-25 15:38:14,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:38:14,932 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 17 states. [2019-02-25 15:38:15,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:15,388 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-02-25 15:38:15,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-25 15:38:15,393 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-02-25 15:38:15,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:15,394 INFO L225 Difference]: With dead ends: 64 [2019-02-25 15:38:15,394 INFO L226 Difference]: Without dead ends: 50 [2019-02-25 15:38:15,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-02-25 15:38:15,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-25 15:38:15,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-02-25 15:38:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-25 15:38:15,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-02-25 15:38:15,407 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2019-02-25 15:38:15,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:15,407 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-02-25 15:38:15,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-25 15:38:15,408 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-02-25 15:38:15,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-25 15:38:15,410 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:15,410 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-02-25 15:38:15,410 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:15,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:15,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1079885042, now seen corresponding path program 7 times [2019-02-25 15:38:15,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:15,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:15,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:15,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:15,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:15,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:15,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:15,960 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:15,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:15,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:15,960 INFO 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-25 15:38:15,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:15,969 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:15,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:38:15,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:16,144 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:16,256 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:16,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:16,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2019-02-25 15:38:16,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:16,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-25 15:38:16,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-25 15:38:16,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:38:16,278 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 17 states. [2019-02-25 15:38:16,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:16,607 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-02-25 15:38:16,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:38:16,607 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-02-25 15:38:16,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:16,609 INFO L225 Difference]: With dead ends: 75 [2019-02-25 15:38:16,609 INFO L226 Difference]: Without dead ends: 40 [2019-02-25 15:38:16,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-02-25 15:38:16,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-25 15:38:16,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-02-25 15:38:16,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-25 15:38:16,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-02-25 15:38:16,618 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-02-25 15:38:16,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:16,618 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-02-25 15:38:16,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-25 15:38:16,619 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-02-25 15:38:16,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-02-25 15:38:16,620 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:16,620 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-02-25 15:38:16,620 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:16,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:16,620 INFO L82 PathProgramCache]: Analyzing trace with hash -921359226, now seen corresponding path program 8 times [2019-02-25 15:38:16,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:16,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:16,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:16,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:16,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:16,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:16,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:16,898 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:16,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:16,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:16,898 INFO 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-25 15:38:16,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:38:16,910 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:38:16,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-25 15:38:16,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:16,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:38:16,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 32 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:17,360 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:18,245 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:18,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:18,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2019-02-25 15:38:18,266 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:18,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-25 15:38:18,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-25 15:38:18,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-02-25 15:38:18,268 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 27 states. [2019-02-25 15:38:20,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:20,735 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-02-25 15:38:20,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-25 15:38:20,736 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-02-25 15:38:20,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:20,737 INFO L225 Difference]: With dead ends: 97 [2019-02-25 15:38:20,737 INFO L226 Difference]: Without dead ends: 58 [2019-02-25 15:38:20,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=499, Invalid=3533, Unknown=0, NotChecked=0, Total=4032 [2019-02-25 15:38:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-25 15:38:20,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2019-02-25 15:38:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-25 15:38:20,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-02-25 15:38:20,749 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2019-02-25 15:38:20,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:20,749 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-02-25 15:38:20,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-25 15:38:20,749 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-02-25 15:38:20,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-25 15:38:20,750 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:20,750 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2019-02-25 15:38:20,751 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:20,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:20,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1868574667, now seen corresponding path program 9 times [2019-02-25 15:38:20,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:20,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:20,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:20,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:20,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:21,210 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:21,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:21,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:21,211 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:21,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:21,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:21,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 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-25 15:38:21,221 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:38:21,221 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:38:21,232 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:38:21,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:21,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 27 conjunts are in the unsatisfiable core [2019-02-25 15:38:21,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:21,563 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:21,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:21,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:21,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2019-02-25 15:38:21,624 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:21,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-25 15:38:21,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-25 15:38:21,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-02-25 15:38:21,625 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 23 states. [2019-02-25 15:38:23,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:23,536 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-02-25 15:38:23,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-25 15:38:23,537 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-02-25 15:38:23,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:23,538 INFO L225 Difference]: With dead ends: 94 [2019-02-25 15:38:23,539 INFO L226 Difference]: Without dead ends: 72 [2019-02-25 15:38:23,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2019-02-25 15:38:23,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-25 15:38:23,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-02-25 15:38:23,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-25 15:38:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-02-25 15:38:23,550 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2019-02-25 15:38:23,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:23,550 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-02-25 15:38:23,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-25 15:38:23,550 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-02-25 15:38:23,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-25 15:38:23,551 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:23,551 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-02-25 15:38:23,552 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:23,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:23,552 INFO L82 PathProgramCache]: Analyzing trace with hash 269550812, now seen corresponding path program 10 times [2019-02-25 15:38:23,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:23,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:23,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:23,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:23,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:23,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:23,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:23,751 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:23,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:23,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:23,751 INFO 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-25 15:38:23,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:23,761 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:23,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:38:23,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:23,996 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:24,111 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:24,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:24,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2019-02-25 15:38:24,135 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:24,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-25 15:38:24,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-25 15:38:24,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-02-25 15:38:24,136 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 23 states. [2019-02-25 15:38:24,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:24,424 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-02-25 15:38:24,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-25 15:38:24,426 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-02-25 15:38:24,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:24,427 INFO L225 Difference]: With dead ends: 105 [2019-02-25 15:38:24,428 INFO L226 Difference]: Without dead ends: 54 [2019-02-25 15:38:24,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-02-25 15:38:24,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-25 15:38:24,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-02-25 15:38:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-25 15:38:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-02-25 15:38:24,439 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2019-02-25 15:38:24,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:24,440 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-02-25 15:38:24,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-25 15:38:24,440 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-02-25 15:38:24,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-25 15:38:24,441 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:24,441 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2019-02-25 15:38:24,441 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:24,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:24,442 INFO L82 PathProgramCache]: Analyzing trace with hash 2089942100, now seen corresponding path program 11 times [2019-02-25 15:38:24,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:24,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:24,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:24,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:24,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:25,032 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:25,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:25,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:25,033 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:25,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:25,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:25,033 INFO 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-25 15:38:25,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:38:25,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:38:25,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-25 15:38:25,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:25,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 31 conjunts are in the unsatisfiable core [2019-02-25 15:38:25,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:25,307 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:25,307 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:25,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:25,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 25 [2019-02-25 15:38:25,369 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:25,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-25 15:38:25,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-25 15:38:25,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-02-25 15:38:25,371 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2019-02-25 15:38:27,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:27,016 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-02-25 15:38:27,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-25 15:38:27,016 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-02-25 15:38:27,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:27,017 INFO L225 Difference]: With dead ends: 109 [2019-02-25 15:38:27,017 INFO L226 Difference]: Without dead ends: 83 [2019-02-25 15:38:27,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2019-02-25 15:38:27,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-25 15:38:27,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2019-02-25 15:38:27,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-25 15:38:27,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-02-25 15:38:27,035 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2019-02-25 15:38:27,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:27,035 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-02-25 15:38:27,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-25 15:38:27,035 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-02-25 15:38:27,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-25 15:38:27,036 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:27,036 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-02-25 15:38:27,037 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:27,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:27,037 INFO L82 PathProgramCache]: Analyzing trace with hash 549587323, now seen corresponding path program 12 times [2019-02-25 15:38:27,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:27,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:27,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:27,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:27,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:27,330 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:27,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:27,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:27,331 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:27,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:27,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:27,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:38:27,343 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:38:27,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:38:27,353 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:38:27,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:27,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:38:27,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:27,509 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:27,509 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:27,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:27,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2019-02-25 15:38:27,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:27,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-25 15:38:27,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-25 15:38:27,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-02-25 15:38:27,637 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2019-02-25 15:38:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:28,025 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-02-25 15:38:28,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-25 15:38:28,026 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-02-25 15:38:28,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:28,026 INFO L225 Difference]: With dead ends: 120 [2019-02-25 15:38:28,026 INFO L226 Difference]: Without dead ends: 61 [2019-02-25 15:38:28,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2019-02-25 15:38:28,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-25 15:38:28,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-02-25 15:38:28,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-25 15:38:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-02-25 15:38:28,041 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2019-02-25 15:38:28,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:28,041 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-02-25 15:38:28,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-25 15:38:28,041 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-02-25 15:38:28,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-25 15:38:28,042 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:28,042 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2019-02-25 15:38:28,042 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:28,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:28,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1743111421, now seen corresponding path program 13 times [2019-02-25 15:38:28,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:28,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:28,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:28,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:28,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:28,720 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:28,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:28,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:28,721 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:28,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:28,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:28,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:38:28,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:28,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:28,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 35 conjunts are in the unsatisfiable core [2019-02-25 15:38:28,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:29,030 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:29,030 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:29,192 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:29,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:29,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 28 [2019-02-25 15:38:29,214 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:29,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-25 15:38:29,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-25 15:38:29,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-02-25 15:38:29,215 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 29 states. [2019-02-25 15:38:31,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:31,031 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-02-25 15:38:31,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-25 15:38:31,032 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-02-25 15:38:31,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:31,033 INFO L225 Difference]: With dead ends: 124 [2019-02-25 15:38:31,033 INFO L226 Difference]: Without dead ends: 94 [2019-02-25 15:38:31,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2019-02-25 15:38:31,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-25 15:38:31,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-02-25 15:38:31,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-25 15:38:31,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-02-25 15:38:31,051 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2019-02-25 15:38:31,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:31,051 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-02-25 15:38:31,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-25 15:38:31,051 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-02-25 15:38:31,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-25 15:38:31,052 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:31,052 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-02-25 15:38:31,054 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:31,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:31,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1415751510, now seen corresponding path program 14 times [2019-02-25 15:38:31,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:31,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:31,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:31,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:31,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:31,277 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:31,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:31,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:31,277 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:31,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:31,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:31,278 INFO 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-25 15:38:31,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:38:31,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:38:31,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-25 15:38:31,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:31,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:38:31,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:31,563 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:31,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:31,715 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:31,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:31,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2019-02-25 15:38:31,736 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:31,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-25 15:38:31,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-25 15:38:31,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-02-25 15:38:31,737 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2019-02-25 15:38:32,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:32,385 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-02-25 15:38:32,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-25 15:38:32,386 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-02-25 15:38:32,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:32,387 INFO L225 Difference]: With dead ends: 135 [2019-02-25 15:38:32,387 INFO L226 Difference]: Without dead ends: 68 [2019-02-25 15:38:32,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:38:32,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-25 15:38:32,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-02-25 15:38:32,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-25 15:38:32,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-02-25 15:38:32,400 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2019-02-25 15:38:32,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:32,400 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-02-25 15:38:32,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-25 15:38:32,400 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-02-25 15:38:32,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-25 15:38:32,401 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:32,402 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2019-02-25 15:38:32,402 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:32,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:32,402 INFO L82 PathProgramCache]: Analyzing trace with hash 175889954, now seen corresponding path program 15 times [2019-02-25 15:38:32,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:32,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:32,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:32,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:32,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:32,917 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:32,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:32,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:32,918 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:32,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:32,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:32,918 INFO 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-25 15:38:32,928 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:38:32,929 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:38:32,954 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:38:32,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:32,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 39 conjunts are in the unsatisfiable core [2019-02-25 15:38:32,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:33,317 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:33,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:33,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 31 [2019-02-25 15:38:33,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:33,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-25 15:38:33,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-25 15:38:33,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:38:33,420 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2019-02-25 15:38:35,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:35,537 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2019-02-25 15:38:35,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-25 15:38:35,537 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 65 [2019-02-25 15:38:35,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:35,539 INFO L225 Difference]: With dead ends: 139 [2019-02-25 15:38:35,539 INFO L226 Difference]: Without dead ends: 105 [2019-02-25 15:38:35,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:38:35,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-25 15:38:35,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2019-02-25 15:38:35,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-25 15:38:35,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-02-25 15:38:35,550 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 65 [2019-02-25 15:38:35,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:35,550 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-02-25 15:38:35,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-25 15:38:35,551 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-02-25 15:38:35,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-25 15:38:35,551 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:35,552 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-02-25 15:38:35,552 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:35,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:35,552 INFO L82 PathProgramCache]: Analyzing trace with hash 2774089, now seen corresponding path program 16 times [2019-02-25 15:38:35,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:35,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:35,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:35,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:35,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:36,098 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:36,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:36,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:36,099 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:36,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:36,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:36,100 INFO 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-25 15:38:36,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:36,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:36,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-25 15:38:36,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:36,831 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:36,831 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:36,988 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:37,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:37,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2019-02-25 15:38:37,009 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:37,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-25 15:38:37,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-25 15:38:37,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:38:37,011 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 32 states. [2019-02-25 15:38:37,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:37,432 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-02-25 15:38:37,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-25 15:38:37,432 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2019-02-25 15:38:37,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:37,433 INFO L225 Difference]: With dead ends: 150 [2019-02-25 15:38:37,434 INFO L226 Difference]: Without dead ends: 75 [2019-02-25 15:38:37,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 108 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=436, Invalid=1286, Unknown=0, NotChecked=0, Total=1722 [2019-02-25 15:38:37,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-25 15:38:37,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-02-25 15:38:37,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-25 15:38:37,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-02-25 15:38:37,447 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2019-02-25 15:38:37,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:37,448 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-02-25 15:38:37,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-25 15:38:37,448 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-02-25 15:38:37,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-25 15:38:37,449 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:37,449 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2019-02-25 15:38:37,449 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:37,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:37,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2036938705, now seen corresponding path program 17 times [2019-02-25 15:38:37,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:37,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:37,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:37,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:37,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 9 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:37,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:37,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:37,952 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:37,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:37,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:37,952 INFO 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-25 15:38:37,962 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:38:37,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:38:37,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-25 15:38:37,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:37,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-25 15:38:37,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 162 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:38,963 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:39,770 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 153 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:39,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:39,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 58 [2019-02-25 15:38:39,792 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:39,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-25 15:38:39,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-25 15:38:39,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3001, Unknown=0, NotChecked=0, Total=3422 [2019-02-25 15:38:39,794 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2019-02-25 15:38:42,595 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-02-25 15:38:44,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:44,713 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2019-02-25 15:38:44,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-25 15:38:44,714 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2019-02-25 15:38:44,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:44,715 INFO L225 Difference]: With dead ends: 192 [2019-02-25 15:38:44,715 INFO L226 Difference]: Without dead ends: 113 [2019-02-25 15:38:44,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3015 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1319, Invalid=12723, Unknown=0, NotChecked=0, Total=14042 [2019-02-25 15:38:44,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-25 15:38:44,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2019-02-25 15:38:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-25 15:38:44,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-02-25 15:38:44,730 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2019-02-25 15:38:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:44,730 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-02-25 15:38:44,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-25 15:38:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-02-25 15:38:44,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-25 15:38:44,731 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:44,731 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2019-02-25 15:38:44,731 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:44,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:44,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1070649840, now seen corresponding path program 18 times [2019-02-25 15:38:44,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:44,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:44,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:44,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:44,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:45,967 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:45,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:45,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:45,968 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:45,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:45,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:45,968 INFO 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-25 15:38:45,978 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:38:45,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:38:45,992 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:38:45,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:45,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 47 conjunts are in the unsatisfiable core [2019-02-25 15:38:45,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:46,575 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:46,576 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:46,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:46,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 37 [2019-02-25 15:38:46,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:46,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-25 15:38:46,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-25 15:38:46,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:38:46,656 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 38 states. [2019-02-25 15:38:48,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:48,913 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2019-02-25 15:38:48,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-25 15:38:48,917 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2019-02-25 15:38:48,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:48,918 INFO L225 Difference]: With dead ends: 169 [2019-02-25 15:38:48,918 INFO L226 Difference]: Without dead ends: 127 [2019-02-25 15:38:48,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2019-02-25 15:38:48,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-25 15:38:48,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2019-02-25 15:38:48,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-25 15:38:48,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-02-25 15:38:48,929 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2019-02-25 15:38:48,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:48,929 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-02-25 15:38:48,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-25 15:38:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-02-25 15:38:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-25 15:38:48,930 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:48,930 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-02-25 15:38:48,930 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:48,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:48,931 INFO L82 PathProgramCache]: Analyzing trace with hash -685461225, now seen corresponding path program 19 times [2019-02-25 15:38:48,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:48,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:48,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:48,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:48,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:49,234 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:49,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:49,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:49,235 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:49,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:49,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:49,235 INFO 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-25 15:38:49,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:49,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:49,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-25 15:38:49,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:49,568 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:49,568 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:49,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:49,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2019-02-25 15:38:49,812 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:49,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-25 15:38:49,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-25 15:38:49,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:38:49,813 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2019-02-25 15:38:50,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:50,551 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2019-02-25 15:38:50,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-25 15:38:50,551 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2019-02-25 15:38:50,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:50,552 INFO L225 Difference]: With dead ends: 180 [2019-02-25 15:38:50,552 INFO L226 Difference]: Without dead ends: 89 [2019-02-25 15:38:50,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 130 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=607, Invalid=1843, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:38:50,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-25 15:38:50,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-02-25 15:38:50,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-25 15:38:50,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-02-25 15:38:50,564 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2019-02-25 15:38:50,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:50,564 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-02-25 15:38:50,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-25 15:38:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-02-25 15:38:50,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-25 15:38:50,565 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:50,566 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2019-02-25 15:38:50,566 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:50,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:50,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1750415713, now seen corresponding path program 20 times [2019-02-25 15:38:50,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:50,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:50,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:50,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:50,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:51,118 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 11 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:51,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:51,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:51,119 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:51,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:51,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:51,119 INFO 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-25 15:38:51,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:38:51,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:38:51,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-25 15:38:51,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:51,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-25 15:38:51,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:52,298 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 242 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:52,299 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:53,313 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 231 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:53,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:53,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 68 [2019-02-25 15:38:53,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:53,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-25 15:38:53,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-25 15:38:53,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=4132, Unknown=0, NotChecked=0, Total=4692 [2019-02-25 15:38:53,338 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 55 states. [2019-02-25 15:39:00,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:00,113 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2019-02-25 15:39:00,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-25 15:39:00,113 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 86 [2019-02-25 15:39:00,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:00,115 INFO L225 Difference]: With dead ends: 230 [2019-02-25 15:39:00,115 INFO L226 Difference]: Without dead ends: 135 [2019-02-25 15:39:00,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1745, Invalid=17995, Unknown=0, NotChecked=0, Total=19740 [2019-02-25 15:39:00,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-25 15:39:00,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2019-02-25 15:39:00,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-25 15:39:00,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-02-25 15:39:00,134 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 86 [2019-02-25 15:39:00,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:00,135 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-02-25 15:39:00,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-25 15:39:00,135 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-02-25 15:39:00,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-25 15:39:00,136 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:00,136 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2019-02-25 15:39:00,136 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:00,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:00,136 INFO L82 PathProgramCache]: Analyzing trace with hash 2005850046, now seen corresponding path program 21 times [2019-02-25 15:39:00,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:00,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:00,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:00,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:00,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:00,974 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:00,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:00,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:00,975 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:00,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:00,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:00,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 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-25 15:39:00,986 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:39:00,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:39:01,002 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:39:01,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:01,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-25 15:39:01,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:01,522 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:01,522 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:01,604 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:01,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:01,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 43 [2019-02-25 15:39:01,625 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:01,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-25 15:39:01,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-25 15:39:01,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1778, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:39:01,626 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 44 states. [2019-02-25 15:39:04,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:04,867 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2019-02-25 15:39:04,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-25 15:39:04,867 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2019-02-25 15:39:04,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:04,868 INFO L225 Difference]: With dead ends: 199 [2019-02-25 15:39:04,868 INFO L226 Difference]: Without dead ends: 149 [2019-02-25 15:39:04,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2019-02-25 15:39:04,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-02-25 15:39:04,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2019-02-25 15:39:04,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-25 15:39:04,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-02-25 15:39:04,883 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2019-02-25 15:39:04,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:04,884 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-02-25 15:39:04,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-25 15:39:04,884 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-02-25 15:39:04,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-02-25 15:39:04,885 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:04,885 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-02-25 15:39:04,885 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:04,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:04,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1370431461, now seen corresponding path program 22 times [2019-02-25 15:39:04,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:04,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:04,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:04,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:04,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:05,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:05,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:05,294 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:05,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:05,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:05,294 INFO 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-25 15:39:05,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:05,304 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:39:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:05,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-25 15:39:05,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:05,964 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:05,965 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:06,776 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:06,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:06,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2019-02-25 15:39:06,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:06,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-25 15:39:06,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-25 15:39:06,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:39:06,799 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 44 states. [2019-02-25 15:39:07,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:07,491 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2019-02-25 15:39:07,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-25 15:39:07,492 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2019-02-25 15:39:07,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:07,493 INFO L225 Difference]: With dead ends: 210 [2019-02-25 15:39:07,493 INFO L226 Difference]: Without dead ends: 103 [2019-02-25 15:39:07,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 152 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=806, Invalid=2500, Unknown=0, NotChecked=0, Total=3306 [2019-02-25 15:39:07,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-25 15:39:07,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-02-25 15:39:07,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-25 15:39:07,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-02-25 15:39:07,510 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2019-02-25 15:39:07,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:07,510 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-02-25 15:39:07,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-25 15:39:07,510 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-02-25 15:39:07,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-25 15:39:07,511 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:07,511 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2019-02-25 15:39:07,511 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:07,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:07,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1811736429, now seen corresponding path program 23 times [2019-02-25 15:39:07,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:07,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:07,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:07,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:07,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:08,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:08,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:08,435 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:08,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:08,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:08,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 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-25 15:39:08,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:39:08,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:39:08,473 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-25 15:39:08,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:08,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 59 conjunts are in the unsatisfiable core [2019-02-25 15:39:08,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:09,156 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:09,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:09,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 46 [2019-02-25 15:39:09,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:09,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-25 15:39:09,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-25 15:39:09,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2019-02-25 15:39:09,273 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 47 states. [2019-02-25 15:39:13,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:13,056 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2019-02-25 15:39:13,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-25 15:39:13,056 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 100 [2019-02-25 15:39:13,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:13,057 INFO L225 Difference]: With dead ends: 214 [2019-02-25 15:39:13,057 INFO L226 Difference]: Without dead ends: 160 [2019-02-25 15:39:13,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2019-02-25 15:39:13,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-02-25 15:39:13,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2019-02-25 15:39:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-25 15:39:13,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2019-02-25 15:39:13,077 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2019-02-25 15:39:13,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:13,077 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2019-02-25 15:39:13,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-25 15:39:13,077 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2019-02-25 15:39:13,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-25 15:39:13,078 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:13,078 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-02-25 15:39:13,078 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:13,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:13,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1008713748, now seen corresponding path program 24 times [2019-02-25 15:39:13,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:13,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:13,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:13,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:13,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:13,620 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:13,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:13,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:13,621 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:13,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:13,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:13,621 INFO 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-25 15:39:13,630 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:39:13,631 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:39:13,649 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:39:13,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:13,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 32 conjunts are in the unsatisfiable core [2019-02-25 15:39:13,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:14,058 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:14,058 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:14,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:14,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2019-02-25 15:39:14,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:14,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-25 15:39:14,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-25 15:39:14,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2019-02-25 15:39:14,384 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2019-02-25 15:39:15,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:15,029 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2019-02-25 15:39:15,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-25 15:39:15,030 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2019-02-25 15:39:15,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:15,031 INFO L225 Difference]: With dead ends: 225 [2019-02-25 15:39:15,031 INFO L226 Difference]: Without dead ends: 110 [2019-02-25 15:39:15,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 163 SyntacticMatches, 29 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:39:15,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-25 15:39:15,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-02-25 15:39:15,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-25 15:39:15,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-02-25 15:39:15,044 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 104 [2019-02-25 15:39:15,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:15,045 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-02-25 15:39:15,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-25 15:39:15,045 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-02-25 15:39:15,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-25 15:39:15,045 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:15,045 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2019-02-25 15:39:15,046 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:15,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:15,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1699483764, now seen corresponding path program 25 times [2019-02-25 15:39:15,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:15,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:15,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:15,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:15,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:16,078 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:16,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:16,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:16,079 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:16,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:16,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:16,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:39:16,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:16,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:39:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:16,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 63 conjunts are in the unsatisfiable core [2019-02-25 15:39:16,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:16,814 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:16,815 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:16,916 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:16,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:16,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 49 [2019-02-25 15:39:16,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:16,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-25 15:39:16,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-25 15:39:16,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:39:16,938 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2019-02-25 15:39:21,804 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-02-25 15:39:22,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:22,134 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2019-02-25 15:39:22,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-25 15:39:22,135 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2019-02-25 15:39:22,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:22,137 INFO L225 Difference]: With dead ends: 229 [2019-02-25 15:39:22,137 INFO L226 Difference]: Without dead ends: 171 [2019-02-25 15:39:22,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=491, Invalid=5829, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:39:22,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-02-25 15:39:22,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2019-02-25 15:39:22,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-25 15:39:22,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-02-25 15:39:22,154 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-02-25 15:39:22,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:22,155 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-02-25 15:39:22,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-25 15:39:22,155 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-02-25 15:39:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-25 15:39:22,155 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:22,155 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-02-25 15:39:22,155 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:22,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:22,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1446534989, now seen corresponding path program 26 times [2019-02-25 15:39:22,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:22,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:22,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:22,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:22,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:22,830 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:22,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:22,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:22,830 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:22,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:22,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:22,831 INFO 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-25 15:39:22,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:39:22,842 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:39:22,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-25 15:39:22,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:22,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-25 15:39:22,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:23,328 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:23,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:23,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2019-02-25 15:39:23,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:23,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-25 15:39:23,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-25 15:39:23,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:39:23,696 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 50 states. [2019-02-25 15:39:24,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:24,317 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2019-02-25 15:39:24,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-25 15:39:24,317 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 111 [2019-02-25 15:39:24,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:24,319 INFO L225 Difference]: With dead ends: 240 [2019-02-25 15:39:24,319 INFO L226 Difference]: Without dead ends: 117 [2019-02-25 15:39:24,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 174 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2019-02-25 15:39:24,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-25 15:39:24,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-02-25 15:39:24,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-25 15:39:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-02-25 15:39:24,338 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 111 [2019-02-25 15:39:24,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:24,339 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-02-25 15:39:24,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-25 15:39:24,339 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-02-25 15:39:24,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-25 15:39:24,339 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:24,340 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2019-02-25 15:39:24,340 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:24,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:24,340 INFO L82 PathProgramCache]: Analyzing trace with hash -2055366085, now seen corresponding path program 27 times [2019-02-25 15:39:24,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:24,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:24,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:24,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:24,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:25,349 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:25,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:25,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:25,349 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:25,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:25,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:25,350 INFO 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-25 15:39:25,360 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:39:25,360 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:39:25,393 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:39:25,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:25,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 67 conjunts are in the unsatisfiable core [2019-02-25 15:39:25,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:26,578 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:26,579 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:26,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:26,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 52 [2019-02-25 15:39:26,704 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:26,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-25 15:39:26,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-25 15:39:26,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2618, Unknown=0, NotChecked=0, Total=2756 [2019-02-25 15:39:26,706 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 53 states. [2019-02-25 15:39:32,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:32,066 INFO L93 Difference]: Finished difference Result 244 states and 249 transitions. [2019-02-25 15:39:32,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-25 15:39:32,069 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 114 [2019-02-25 15:39:32,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:32,071 INFO L225 Difference]: With dead ends: 244 [2019-02-25 15:39:32,071 INFO L226 Difference]: Without dead ends: 182 [2019-02-25 15:39:32,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=539, Invalid=6601, Unknown=0, NotChecked=0, Total=7140 [2019-02-25 15:39:32,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-02-25 15:39:32,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2019-02-25 15:39:32,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-02-25 15:39:32,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-02-25 15:39:32,099 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2019-02-25 15:39:32,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:32,100 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-02-25 15:39:32,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-25 15:39:32,100 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-02-25 15:39:32,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-02-25 15:39:32,101 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:32,101 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-02-25 15:39:32,101 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:32,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:32,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1833851874, now seen corresponding path program 28 times [2019-02-25 15:39:32,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:32,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:32,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:32,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:32,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:32,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:32,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:32,669 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:32,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:32,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:32,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:39:32,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:32,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:39:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:32,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 36 conjunts are in the unsatisfiable core [2019-02-25 15:39:32,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:33,274 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:33,274 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:33,645 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:33,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:33,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2019-02-25 15:39:33,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:33,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-25 15:39:33,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-25 15:39:33,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2019-02-25 15:39:33,669 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 53 states. [2019-02-25 15:39:34,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:34,631 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2019-02-25 15:39:34,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-25 15:39:34,631 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 118 [2019-02-25 15:39:34,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:34,632 INFO L225 Difference]: With dead ends: 255 [2019-02-25 15:39:34,633 INFO L226 Difference]: Without dead ends: 124 [2019-02-25 15:39:34,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 185 SyntacticMatches, 33 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2019-02-25 15:39:34,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-02-25 15:39:34,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-02-25 15:39:34,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-02-25 15:39:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-02-25 15:39:34,652 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 118 [2019-02-25 15:39:34,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:34,652 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-02-25 15:39:34,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-25 15:39:34,652 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-02-25 15:39:34,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-02-25 15:39:34,653 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:34,653 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2019-02-25 15:39:34,653 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:34,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:34,653 INFO L82 PathProgramCache]: Analyzing trace with hash 540940634, now seen corresponding path program 29 times [2019-02-25 15:39:34,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:34,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:34,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:34,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:34,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:35,588 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 16 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:35,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:35,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:35,589 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:35,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:35,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:35,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:39:35,600 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:39:35,601 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:39:35,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-25 15:39:35,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:35,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-25 15:39:35,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:37,927 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 512 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:37,928 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:39,773 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 496 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:39,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:39,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 93 [2019-02-25 15:39:39,795 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:39,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-25 15:39:39,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-25 15:39:39,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=7747, Unknown=0, NotChecked=0, Total=8742 [2019-02-25 15:39:39,797 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 75 states. [2019-02-25 15:39:50,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:50,721 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2019-02-25 15:39:50,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-02-25 15:39:50,722 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 121 [2019-02-25 15:39:50,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:50,724 INFO L225 Difference]: With dead ends: 325 [2019-02-25 15:39:50,724 INFO L226 Difference]: Without dead ends: 190 [2019-02-25 15:39:50,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 167 SyntacticMatches, 18 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8265 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=3055, Invalid=35165, Unknown=0, NotChecked=0, Total=38220 [2019-02-25 15:39:50,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-02-25 15:39:50,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2019-02-25 15:39:50,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-02-25 15:39:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-02-25 15:39:50,747 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 121 [2019-02-25 15:39:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:50,747 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-02-25 15:39:50,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-25 15:39:50,747 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-02-25 15:39:50,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-02-25 15:39:50,747 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:50,748 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2019-02-25 15:39:50,748 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:50,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:50,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1991581943, now seen corresponding path program 30 times [2019-02-25 15:39:50,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:50,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:50,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:50,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:50,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:51,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:51,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:51,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:51,961 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:51,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:51,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:51,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:39:51,971 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:39:51,971 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:39:51,994 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:39:51,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:51,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 75 conjunts are in the unsatisfiable core [2019-02-25 15:39:51,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:52,895 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:53,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:53,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 58 [2019-02-25 15:39:53,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:53,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-25 15:39:53,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-25 15:39:53,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2019-02-25 15:39:53,042 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2019-02-25 15:39:56,716 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-02-25 15:39:57,076 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-02-25 15:39:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:58,904 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2019-02-25 15:39:58,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-25 15:39:58,904 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2019-02-25 15:39:58,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:58,906 INFO L225 Difference]: With dead ends: 274 [2019-02-25 15:39:58,906 INFO L226 Difference]: Without dead ends: 204 [2019-02-25 15:39:58,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=641, Invalid=8289, Unknown=0, NotChecked=0, Total=8930 [2019-02-25 15:39:58,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-02-25 15:39:58,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2019-02-25 15:39:58,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-25 15:39:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2019-02-25 15:39:58,943 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2019-02-25 15:39:58,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:58,943 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2019-02-25 15:39:58,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-25 15:39:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2019-02-25 15:39:58,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-25 15:39:58,944 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:58,944 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-02-25 15:39:58,944 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:58,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:58,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1942976080, now seen corresponding path program 31 times [2019-02-25 15:39:58,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:58,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:58,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:58,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:58,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:59,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:59,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:59,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:59,597 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:59,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:59,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:59,598 INFO 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-25 15:39:59,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:59,616 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:39:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:59,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-25 15:39:59,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:00,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:00,282 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:00,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:00,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2019-02-25 15:40:00,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:00,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-25 15:40:00,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-25 15:40:00,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2019-02-25 15:40:00,801 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 59 states. [2019-02-25 15:40:01,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:01,782 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2019-02-25 15:40:01,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-25 15:40:01,783 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 132 [2019-02-25 15:40:01,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:01,784 INFO L225 Difference]: With dead ends: 285 [2019-02-25 15:40:01,784 INFO L226 Difference]: Without dead ends: 138 [2019-02-25 15:40:01,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 207 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2019-02-25 15:40:01,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-25 15:40:01,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-02-25 15:40:01,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-02-25 15:40:01,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-02-25 15:40:01,825 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2019-02-25 15:40:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:01,827 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-02-25 15:40:01,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-25 15:40:01,827 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-02-25 15:40:01,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-02-25 15:40:01,828 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:01,828 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2019-02-25 15:40:01,828 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:01,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:01,829 INFO L82 PathProgramCache]: Analyzing trace with hash 220943656, now seen corresponding path program 32 times [2019-02-25 15:40:01,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:01,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:01,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:40:01,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:01,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:03,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 18 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:03,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:03,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:03,326 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:03,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:03,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:03,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:40:03,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:40:03,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:40:03,392 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-25 15:40:03,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:40:03,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 44 conjunts are in the unsatisfiable core [2019-02-25 15:40:03,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:06,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 648 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:06,066 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:08,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 630 proven. 568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:08,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:08,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 103 [2019-02-25 15:40:08,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:08,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-25 15:40:08,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-25 15:40:08,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1204, Invalid=9508, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:40:08,518 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 83 states. [2019-02-25 15:40:19,959 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-02-25 15:40:20,268 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-02-25 15:40:23,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:23,065 INFO L93 Difference]: Finished difference Result 363 states and 369 transitions. [2019-02-25 15:40:23,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-02-25 15:40:23,066 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 135 [2019-02-25 15:40:23,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:23,067 INFO L225 Difference]: With dead ends: 363 [2019-02-25 15:40:23,067 INFO L226 Difference]: Without dead ends: 212 [2019-02-25 15:40:23,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10242 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=3677, Invalid=43629, Unknown=0, NotChecked=0, Total=47306 [2019-02-25 15:40:23,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-02-25 15:40:23,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2019-02-25 15:40:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-02-25 15:40:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2019-02-25 15:40:23,094 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2019-02-25 15:40:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:23,094 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2019-02-25 15:40:23,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-25 15:40:23,095 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2019-02-25 15:40:23,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-02-25 15:40:23,095 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:23,095 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2019-02-25 15:40:23,096 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:23,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:23,096 INFO L82 PathProgramCache]: Analyzing trace with hash 847427031, now seen corresponding path program 33 times [2019-02-25 15:40:23,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:23,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:23,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:40:23,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:23,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:24,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:24,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:24,442 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:24,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:24,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:24,442 INFO 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-25 15:40:24,453 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:40:24,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:40:24,491 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:40:24,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:40:24,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 83 conjunts are in the unsatisfiable core [2019-02-25 15:40:24,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:25,959 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:26,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:26,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 64 [2019-02-25 15:40:26,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:26,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-25 15:40:26,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-25 15:40:26,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3990, Unknown=0, NotChecked=0, Total=4160 [2019-02-25 15:40:26,110 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 65 states. [2019-02-25 15:40:30,648 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-25 15:40:30,937 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-25 15:40:31,210 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-02-25 15:40:31,394 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-25 15:40:33,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:33,368 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2019-02-25 15:40:33,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-25 15:40:33,368 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 142 [2019-02-25 15:40:33,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:33,369 INFO L225 Difference]: With dead ends: 304 [2019-02-25 15:40:33,369 INFO L226 Difference]: Without dead ends: 226 [2019-02-25 15:40:33,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=751, Invalid=10169, Unknown=0, NotChecked=0, Total=10920 [2019-02-25 15:40:33,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-02-25 15:40:33,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147. [2019-02-25 15:40:33,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-02-25 15:40:33,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2019-02-25 15:40:33,399 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 142 [2019-02-25 15:40:33,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:33,399 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2019-02-25 15:40:33,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-25 15:40:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2019-02-25 15:40:33,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-02-25 15:40:33,400 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:33,400 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-02-25 15:40:33,401 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:33,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:33,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1796978306, now seen corresponding path program 34 times [2019-02-25 15:40:33,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:33,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:33,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:40:33,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:33,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:35,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:35,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:35,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:35,149 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:35,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:35,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:35,150 INFO 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-25 15:40:35,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:40:35,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:40:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:35,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 44 conjunts are in the unsatisfiable core [2019-02-25 15:40:35,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:36,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:36,032 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:36,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:36,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2019-02-25 15:40:36,666 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:36,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-25 15:40:36,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-25 15:40:36,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2019-02-25 15:40:36,667 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 65 states. [2019-02-25 15:40:38,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:38,297 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2019-02-25 15:40:38,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-25 15:40:38,297 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 146 [2019-02-25 15:40:38,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:38,299 INFO L225 Difference]: With dead ends: 315 [2019-02-25 15:40:38,299 INFO L226 Difference]: Without dead ends: 152 [2019-02-25 15:40:38,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 229 SyntacticMatches, 41 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1723, Invalid=5587, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:40:38,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-02-25 15:40:38,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-02-25 15:40:38,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-02-25 15:40:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-02-25 15:40:38,336 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2019-02-25 15:40:38,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:38,336 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-02-25 15:40:38,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-25 15:40:38,337 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-02-25 15:40:38,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-02-25 15:40:38,338 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:38,338 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2019-02-25 15:40:38,338 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:38,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:38,339 INFO L82 PathProgramCache]: Analyzing trace with hash -193355018, now seen corresponding path program 35 times [2019-02-25 15:40:38,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:38,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:38,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:40:38,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:38,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 20 proven. 1451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:40,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:40,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:40,343 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:40,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:40,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:40,343 INFO 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-25 15:40:40,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:40:40,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:40:40,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-25 15:40:40,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:40:40,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 48 conjunts are in the unsatisfiable core [2019-02-25 15:40:40,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:43,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 800 proven. 671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:43,962 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:46,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 780 proven. 691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:46,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:46,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 46] total 113 [2019-02-25 15:40:46,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:46,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-25 15:40:46,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-25 15:40:46,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=11449, Unknown=0, NotChecked=0, Total=12882 [2019-02-25 15:40:46,687 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 91 states. [2019-02-25 15:40:58,359 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 24 [2019-02-25 15:40:59,325 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-25 15:40:59,650 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-25 15:40:59,979 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-25 15:41:00,262 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:41:00,543 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-25 15:41:03,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:03,109 INFO L93 Difference]: Finished difference Result 401 states and 407 transitions. [2019-02-25 15:41:03,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-02-25 15:41:03,109 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 149 [2019-02-25 15:41:03,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:03,111 INFO L225 Difference]: With dead ends: 401 [2019-02-25 15:41:03,111 INFO L226 Difference]: Without dead ends: 234 [2019-02-25 15:41:03,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 207 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12431 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=4355, Invalid=53005, Unknown=0, NotChecked=0, Total=57360 [2019-02-25 15:41:03,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-02-25 15:41:03,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2019-02-25 15:41:03,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-25 15:41:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2019-02-25 15:41:03,144 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 149 [2019-02-25 15:41:03,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:03,145 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2019-02-25 15:41:03,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-25 15:41:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2019-02-25 15:41:03,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-25 15:41:03,146 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:03,146 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2019-02-25 15:41:03,146 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:03,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:03,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1380130469, now seen corresponding path program 36 times [2019-02-25 15:41:03,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:03,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:03,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:41:03,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:03,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:05,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:05,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:41:05,072 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:41:05,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:41:05,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:05,072 INFO 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-25 15:41:05,081 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:41:05,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:41:05,111 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:41:05,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:41:05,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-25 15:41:05,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:41:06,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:06,486 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:41:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:06,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:41:06,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 70 [2019-02-25 15:41:06,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:41:06,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-25 15:41:06,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-25 15:41:06,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4784, Unknown=0, NotChecked=0, Total=4970 [2019-02-25 15:41:06,651 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 71 states. [2019-02-25 15:41:12,711 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-25 15:41:13,040 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-25 15:41:13,358 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-25 15:41:13,623 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:41:13,833 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:41:14,023 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-25 15:41:15,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:15,933 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2019-02-25 15:41:15,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-25 15:41:15,934 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 156 [2019-02-25 15:41:15,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:15,935 INFO L225 Difference]: With dead ends: 334 [2019-02-25 15:41:15,935 INFO L226 Difference]: Without dead ends: 248 [2019-02-25 15:41:15,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2019-02-25 15:41:15,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-02-25 15:41:15,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 161. [2019-02-25 15:41:15,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-25 15:41:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-02-25 15:41:15,975 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 156 [2019-02-25 15:41:15,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:15,975 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-02-25 15:41:15,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-25 15:41:15,976 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-02-25 15:41:15,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-25 15:41:15,977 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:15,977 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-02-25 15:41:15,977 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:15,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:15,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1719166132, now seen corresponding path program 37 times [2019-02-25 15:41:15,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:15,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:15,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:41:15,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:15,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:17,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:17,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:17,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:41:17,144 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:41:17,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:41:17,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:17,144 INFO 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-25 15:41:17,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:41:17,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:41:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:17,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 48 conjunts are in the unsatisfiable core [2019-02-25 15:41:17,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:41:18,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:18,156 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:41:19,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:19,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:41:19,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 70 [2019-02-25 15:41:19,134 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:41:19,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-25 15:41:19,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-25 15:41:19,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2019-02-25 15:41:19,135 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 71 states. [2019-02-25 15:41:20,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:20,886 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2019-02-25 15:41:20,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-25 15:41:20,888 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2019-02-25 15:41:20,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:20,889 INFO L225 Difference]: With dead ends: 345 [2019-02-25 15:41:20,889 INFO L226 Difference]: Without dead ends: 166 [2019-02-25 15:41:20,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 251 SyntacticMatches, 45 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2048, Invalid=6694, Unknown=0, NotChecked=0, Total=8742 [2019-02-25 15:41:20,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-02-25 15:41:20,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-02-25 15:41:20,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-02-25 15:41:20,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2019-02-25 15:41:20,917 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 160 [2019-02-25 15:41:20,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:20,917 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2019-02-25 15:41:20,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-25 15:41:20,918 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2019-02-25 15:41:20,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-02-25 15:41:20,918 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:20,918 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2019-02-25 15:41:20,919 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:20,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:20,919 INFO L82 PathProgramCache]: Analyzing trace with hash -148438332, now seen corresponding path program 38 times [2019-02-25 15:41:20,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:20,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:20,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:41:20,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:20,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:23,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:23,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:41:23,086 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:41:23,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:41:23,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:23,086 INFO 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-25 15:41:23,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:41:23,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:41:23,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-25 15:41:23,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:41:23,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 95 conjunts are in the unsatisfiable core [2019-02-25 15:41:23,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:41:24,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:24,910 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:41:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:25,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:41:25,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 73 [2019-02-25 15:41:25,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:41:25,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-25 15:41:25,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-25 15:41:25,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5208, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:41:25,081 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 74 states. [2019-02-25 15:41:32,372 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-25 15:41:32,722 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-25 15:41:33,060 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-25 15:41:33,308 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:41:33,522 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:41:33,731 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:41:34,153 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-02-25 15:41:35,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:35,924 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2019-02-25 15:41:35,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-25 15:41:35,925 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 163 [2019-02-25 15:41:35,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:35,926 INFO L225 Difference]: With dead ends: 349 [2019-02-25 15:41:35,926 INFO L226 Difference]: Without dead ends: 259 [2019-02-25 15:41:35,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=931, Invalid=13349, Unknown=0, NotChecked=0, Total=14280 [2019-02-25 15:41:35,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-02-25 15:41:35,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2019-02-25 15:41:35,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-02-25 15:41:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2019-02-25 15:41:35,956 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2019-02-25 15:41:35,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:35,956 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2019-02-25 15:41:35,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-25 15:41:35,957 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2019-02-25 15:41:35,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-02-25 15:41:35,957 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:35,957 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-02-25 15:41:35,958 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:35,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:35,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1550952469, now seen corresponding path program 39 times [2019-02-25 15:41:35,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:35,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:35,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:41:35,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:35,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:36,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:36,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:41:36,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:41:36,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:41:36,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:36,954 INFO 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-25 15:41:36,964 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:41:36,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:41:36,990 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:41:36,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:41:36,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 50 conjunts are in the unsatisfiable core [2019-02-25 15:41:36,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:41:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:38,036 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:41:38,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:38,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:41:38,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 73 [2019-02-25 15:41:38,782 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:41:38,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-25 15:41:38,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-25 15:41:38,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:41:38,784 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 74 states. [2019-02-25 15:41:40,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:40,793 INFO L93 Difference]: Finished difference Result 360 states and 364 transitions. [2019-02-25 15:41:40,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-25 15:41:40,793 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 167 [2019-02-25 15:41:40,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:40,794 INFO L225 Difference]: With dead ends: 360 [2019-02-25 15:41:40,795 INFO L226 Difference]: Without dead ends: 173 [2019-02-25 15:41:40,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 262 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2221, Invalid=7285, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:41:40,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-25 15:41:40,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-02-25 15:41:40,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-02-25 15:41:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-02-25 15:41:40,827 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2019-02-25 15:41:40,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:40,827 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2019-02-25 15:41:40,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-25 15:41:40,828 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2019-02-25 15:41:40,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-02-25 15:41:40,829 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:40,829 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2019-02-25 15:41:40,829 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:40,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:40,829 INFO L82 PathProgramCache]: Analyzing trace with hash -810935949, now seen corresponding path program 40 times [2019-02-25 15:41:40,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:40,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:40,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:41:40,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:40,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:42,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:42,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:41:42,833 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:41:42,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:41:42,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:42,833 INFO 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-25 15:41:42,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:41:42,844 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:41:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:42,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 99 conjunts are in the unsatisfiable core [2019-02-25 15:41:42,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:41:44,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:44,796 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:41:44,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:44,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:41:44,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 76 [2019-02-25 15:41:44,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:41:44,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-25 15:41:44,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-25 15:41:44,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=5650, Unknown=0, NotChecked=0, Total=5852 [2019-02-25 15:41:44,976 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 77 states. [2019-02-25 15:41:52,729 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-25 15:41:53,089 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-25 15:41:53,438 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-25 15:41:53,674 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:41:53,891 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:41:54,104 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:41:54,321 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:41:54,551 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-25 15:41:54,796 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-02-25 15:41:56,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:56,612 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2019-02-25 15:41:56,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-25 15:41:56,613 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 170 [2019-02-25 15:41:56,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:56,615 INFO L225 Difference]: With dead ends: 364 [2019-02-25 15:41:56,615 INFO L226 Difference]: Without dead ends: 270 [2019-02-25 15:41:56,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=995, Invalid=14505, Unknown=0, NotChecked=0, Total=15500 [2019-02-25 15:41:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-02-25 15:41:56,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2019-02-25 15:41:56,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-02-25 15:41:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2019-02-25 15:41:56,646 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 170 [2019-02-25 15:41:56,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:56,646 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2019-02-25 15:41:56,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-25 15:41:56,646 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2019-02-25 15:41:56,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-02-25 15:41:56,647 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:56,647 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-02-25 15:41:56,647 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:56,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:56,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484838, now seen corresponding path program 41 times [2019-02-25 15:41:56,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:56,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:56,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:41:56,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:56,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:58,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:58,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:58,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:41:58,433 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:41:58,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:41:58,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:58,433 INFO 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-25 15:41:58,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:41:58,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:41:58,575 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-25 15:41:58,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:41:58,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-25 15:41:58,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:42:00,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:00,136 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:42:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:00,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:42:00,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 76 [2019-02-25 15:42:00,936 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:42:00,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-25 15:42:00,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-25 15:42:00,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2019-02-25 15:42:00,938 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 77 states. [2019-02-25 15:42:02,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:42:02,846 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2019-02-25 15:42:02,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-25 15:42:02,846 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 174 [2019-02-25 15:42:02,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:42:02,848 INFO L225 Difference]: With dead ends: 375 [2019-02-25 15:42:02,848 INFO L226 Difference]: Without dead ends: 180 [2019-02-25 15:42:02,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 273 SyntacticMatches, 49 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2019-02-25 15:42:02,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-02-25 15:42:02,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-02-25 15:42:02,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-02-25 15:42:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-02-25 15:42:02,880 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 174 [2019-02-25 15:42:02,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:42:02,880 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-02-25 15:42:02,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-25 15:42:02,880 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-02-25 15:42:02,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-02-25 15:42:02,881 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:42:02,881 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2019-02-25 15:42:02,881 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:42:02,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:42:02,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1003391854, now seen corresponding path program 42 times [2019-02-25 15:42:02,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:42:02,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:02,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:42:02,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:02,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:42:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:04,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:04,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:04,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:42:04,528 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:42:04,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:42:04,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:04,528 INFO 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-25 15:42:04,537 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:42:04,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:42:04,568 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:42:04,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:42:04,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 103 conjunts are in the unsatisfiable core [2019-02-25 15:42:04,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:42:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:06,566 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:42:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:06,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:42:06,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 79 [2019-02-25 15:42:06,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:42:06,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-25 15:42:06,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-25 15:42:06,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=6110, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:42:06,781 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 80 states. [2019-02-25 15:42:13,403 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-25 15:42:13,785 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-25 15:42:14,154 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-25 15:42:14,403 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:42:14,652 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:42:14,884 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:42:15,158 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:42:15,405 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:42:17,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:42:17,689 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2019-02-25 15:42:17,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-25 15:42:17,690 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 177 [2019-02-25 15:42:17,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:42:17,692 INFO L225 Difference]: With dead ends: 379 [2019-02-25 15:42:17,692 INFO L226 Difference]: Without dead ends: 281 [2019-02-25 15:42:17,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=1061, Invalid=15709, Unknown=0, NotChecked=0, Total=16770 [2019-02-25 15:42:17,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-02-25 15:42:17,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2019-02-25 15:42:17,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-02-25 15:42:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-02-25 15:42:17,736 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2019-02-25 15:42:17,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:42:17,736 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-02-25 15:42:17,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-25 15:42:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-02-25 15:42:17,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-02-25 15:42:17,737 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:42:17,737 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-02-25 15:42:17,737 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:42:17,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:42:17,738 INFO L82 PathProgramCache]: Analyzing trace with hash 525284025, now seen corresponding path program 43 times [2019-02-25 15:42:17,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:42:17,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:17,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:42:17,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:17,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:42:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:18,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:18,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:18,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:42:18,730 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:42:18,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:42:18,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:18,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:42:18,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:42:18,739 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:42:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:18,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 54 conjunts are in the unsatisfiable core [2019-02-25 15:42:18,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:42:19,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:19,910 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:42:21,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:21,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:42:21,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 79 [2019-02-25 15:42:21,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:42:21,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-25 15:42:21,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-25 15:42:21,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:42:21,109 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 80 states. [2019-02-25 15:42:23,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:42:23,154 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2019-02-25 15:42:23,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-25 15:42:23,154 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 181 [2019-02-25 15:42:23,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:42:23,155 INFO L225 Difference]: With dead ends: 390 [2019-02-25 15:42:23,156 INFO L226 Difference]: Without dead ends: 187 [2019-02-25 15:42:23,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 284 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2588, Invalid=8542, Unknown=0, NotChecked=0, Total=11130 [2019-02-25 15:42:23,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-02-25 15:42:23,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-02-25 15:42:23,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-25 15:42:23,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2019-02-25 15:42:23,207 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 181 [2019-02-25 15:42:23,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:42:23,207 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2019-02-25 15:42:23,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-25 15:42:23,207 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2019-02-25 15:42:23,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-02-25 15:42:23,208 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:42:23,208 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2019-02-25 15:42:23,209 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:42:23,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:42:23,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1479170495, now seen corresponding path program 44 times [2019-02-25 15:42:23,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:42:23,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:23,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:42:23,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:23,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:42:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:25,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 25 proven. 2251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:25,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:25,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:42:25,966 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:42:25,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:42:25,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:25,967 INFO 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-25 15:42:25,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:42:25,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:42:26,035 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-25 15:42:26,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:42:26,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-25 15:42:26,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:42:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1250 proven. 1026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:30,368 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:42:34,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1225 proven. 1051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:34,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:42:34,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56, 56] total 138 [2019-02-25 15:42:34,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:42:34,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-02-25 15:42:34,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-02-25 15:42:34,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=17089, Unknown=0, NotChecked=0, Total=19182 [2019-02-25 15:42:34,731 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 111 states. [2019-02-25 15:42:53,362 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-25 15:42:53,831 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-25 15:42:54,315 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-25 15:42:54,711 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:42:55,097 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:42:55,474 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:42:55,837 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:42:56,238 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:42:56,558 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:42:57,766 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-02-25 15:42:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:42:59,885 INFO L93 Difference]: Finished difference Result 496 states and 502 transitions. [2019-02-25 15:42:59,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-02-25 15:42:59,886 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 184 [2019-02-25 15:42:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:42:59,888 INFO L225 Difference]: With dead ends: 496 [2019-02-25 15:42:59,888 INFO L226 Difference]: Without dead ends: 289 [2019-02-25 15:42:59,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 257 SyntacticMatches, 27 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18831 ImplicationChecksByTransitivity, 29.6s TimeCoverageRelationStatistics Valid=6295, Invalid=80435, Unknown=0, NotChecked=0, Total=86730 [2019-02-25 15:42:59,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-02-25 15:42:59,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2019-02-25 15:42:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-02-25 15:42:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2019-02-25 15:42:59,928 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 184 [2019-02-25 15:42:59,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:42:59,928 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2019-02-25 15:42:59,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-02-25 15:42:59,928 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2019-02-25 15:42:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-02-25 15:42:59,929 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:42:59,929 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2019-02-25 15:42:59,929 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:42:59,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:42:59,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1734936480, now seen corresponding path program 45 times [2019-02-25 15:42:59,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:42:59,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:59,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:42:59,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:59,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:42:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:43:01,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:01,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:01,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:43:01,970 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:43:01,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:43:01,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:01,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 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-25 15:43:01,979 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:43:01,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:43:02,008 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:43:02,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:43:02,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 111 conjunts are in the unsatisfiable core [2019-02-25 15:43:02,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:43:03,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:03,970 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:43:04,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:04,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:43:04,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 85 [2019-02-25 15:43:04,385 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:43:04,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-25 15:43:04,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-25 15:43:04,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7084, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:43:04,386 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 86 states. [2019-02-25 15:43:13,269 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-25 15:43:13,691 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-25 15:43:14,107 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-25 15:43:14,389 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-25 15:43:14,662 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:43:14,926 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:43:15,186 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:43:15,424 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:43:15,663 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:43:15,888 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:43:16,126 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-25 15:43:16,586 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-02-25 15:43:18,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:43:18,409 INFO L93 Difference]: Finished difference Result 409 states and 414 transitions. [2019-02-25 15:43:18,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-02-25 15:43:18,409 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 191 [2019-02-25 15:43:18,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:43:18,410 INFO L225 Difference]: With dead ends: 409 [2019-02-25 15:43:18,410 INFO L226 Difference]: Without dead ends: 303 [2019-02-25 15:43:18,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1199, Invalid=18261, Unknown=0, NotChecked=0, Total=19460 [2019-02-25 15:43:18,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-02-25 15:43:18,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 196. [2019-02-25 15:43:18,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-02-25 15:43:18,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2019-02-25 15:43:18,451 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 191 [2019-02-25 15:43:18,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:43:18,451 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2019-02-25 15:43:18,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-25 15:43:18,452 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2019-02-25 15:43:18,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-02-25 15:43:18,452 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:43:18,452 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2019-02-25 15:43:18,453 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:43:18,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:43:18,453 INFO L82 PathProgramCache]: Analyzing trace with hash 2056396679, now seen corresponding path program 46 times [2019-02-25 15:43:18,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:43:18,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:18,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:43:18,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:18,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:43:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:43:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:19,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:19,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:43:19,519 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:43:19,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:43:19,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:19,519 INFO 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-25 15:43:19,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:43:19,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:43:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:43:19,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-25 15:43:19,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:43:21,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:21,217 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:43:22,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:22,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:43:22,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 85 [2019-02-25 15:43:22,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:43:22,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-25 15:43:22,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-25 15:43:22,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:43:22,622 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 86 states. [2019-02-25 15:43:25,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:43:25,005 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2019-02-25 15:43:25,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-25 15:43:25,006 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 195 [2019-02-25 15:43:25,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:43:25,007 INFO L225 Difference]: With dead ends: 420 [2019-02-25 15:43:25,007 INFO L226 Difference]: Without dead ends: 201 [2019-02-25 15:43:25,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 306 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2983, Invalid=9899, Unknown=0, NotChecked=0, Total=12882 [2019-02-25 15:43:25,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-02-25 15:43:25,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-02-25 15:43:25,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-02-25 15:43:25,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2019-02-25 15:43:25,048 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 195 [2019-02-25 15:43:25,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:43:25,048 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2019-02-25 15:43:25,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-25 15:43:25,048 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2019-02-25 15:43:25,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-02-25 15:43:25,049 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:43:25,049 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2019-02-25 15:43:25,049 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:43:25,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:43:25,049 INFO L82 PathProgramCache]: Analyzing trace with hash -303839985, now seen corresponding path program 47 times [2019-02-25 15:43:25,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:43:25,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:25,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:43:25,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:25,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:43:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:43:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:27,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:27,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:43:27,286 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:43:27,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:43:27,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:27,286 INFO 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-25 15:43:27,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:43:27,295 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:43:27,352 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-25 15:43:27,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:43:27,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 115 conjunts are in the unsatisfiable core [2019-02-25 15:43:27,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:43:29,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:29,371 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:43:29,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:29,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:43:29,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 88 [2019-02-25 15:43:29,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:43:29,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-25 15:43:29,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-25 15:43:29,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=7598, Unknown=0, NotChecked=0, Total=7832 [2019-02-25 15:43:29,582 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 89 states. [2019-02-25 15:43:38,566 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-25 15:43:39,003 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-25 15:43:39,419 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-25 15:43:39,717 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-25 15:43:40,009 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-25 15:43:40,299 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:43:40,588 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:43:40,849 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:43:41,109 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:43:41,343 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:43:41,580 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:43:41,826 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-25 15:43:42,060 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-02-25 15:43:42,328 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-02-25 15:43:44,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:43:44,178 INFO L93 Difference]: Finished difference Result 424 states and 429 transitions. [2019-02-25 15:43:44,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-02-25 15:43:44,178 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 198 [2019-02-25 15:43:44,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:43:44,180 INFO L225 Difference]: With dead ends: 424 [2019-02-25 15:43:44,180 INFO L226 Difference]: Without dead ends: 314 [2019-02-25 15:43:44,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=1271, Invalid=19609, Unknown=0, NotChecked=0, Total=20880 [2019-02-25 15:43:44,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-02-25 15:43:44,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2019-02-25 15:43:44,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-02-25 15:43:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2019-02-25 15:43:44,234 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 198 [2019-02-25 15:43:44,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:43:44,234 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2019-02-25 15:43:44,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-25 15:43:44,235 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2019-02-25 15:43:44,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-02-25 15:43:44,236 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:43:44,236 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-02-25 15:43:44,236 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:43:44,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:43:44,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1908736842, now seen corresponding path program 48 times [2019-02-25 15:43:44,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:43:44,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:44,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:43:44,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:44,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:43:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:43:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:45,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:45,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:43:45,572 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:43:45,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:43:45,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:45,573 INFO 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-25 15:43:45,584 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:43:45,584 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:43:45,615 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:43:45,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:43:45,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 60 conjunts are in the unsatisfiable core [2019-02-25 15:43:45,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:43:46,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:46,989 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:43:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:48,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:43:48,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 88 [2019-02-25 15:43:48,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:43:48,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-25 15:43:48,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-25 15:43:48,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2019-02-25 15:43:48,341 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 89 states. [2019-02-25 15:43:50,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:43:50,853 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2019-02-25 15:43:50,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-25 15:43:50,853 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 202 [2019-02-25 15:43:50,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:43:50,854 INFO L225 Difference]: With dead ends: 435 [2019-02-25 15:43:50,854 INFO L226 Difference]: Without dead ends: 208 [2019-02-25 15:43:50,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 317 SyntacticMatches, 57 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3191, Invalid=10615, Unknown=0, NotChecked=0, Total=13806 [2019-02-25 15:43:50,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-02-25 15:43:50,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-02-25 15:43:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-02-25 15:43:50,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-02-25 15:43:50,907 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2019-02-25 15:43:50,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:43:50,908 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2019-02-25 15:43:50,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-25 15:43:50,908 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2019-02-25 15:43:50,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-02-25 15:43:50,908 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:43:50,909 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2019-02-25 15:43:50,909 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:43:50,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:43:50,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1062571566, now seen corresponding path program 49 times [2019-02-25 15:43:50,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:43:50,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:50,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:43:50,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:50,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:43:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:43:53,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:53,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:53,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:43:53,306 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:43:53,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:43:53,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:53,306 INFO 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-25 15:43:53,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:43:53,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:43:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:43:53,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 119 conjunts are in the unsatisfiable core [2019-02-25 15:43:53,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:43:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:55,520 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:43:55,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:55,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:43:55,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 91 [2019-02-25 15:43:55,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:43:55,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-25 15:43:55,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-25 15:43:55,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=8130, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:43:55,755 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 92 states. [2019-02-25 15:44:05,253 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-25 15:44:05,736 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-25 15:44:06,182 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-25 15:44:06,501 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-25 15:44:06,803 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-25 15:44:07,101 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-25 15:44:07,391 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:44:07,714 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:44:08,045 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:44:08,303 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:44:08,548 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:44:08,789 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:44:11,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:44:11,368 INFO L93 Difference]: Finished difference Result 439 states and 444 transitions. [2019-02-25 15:44:11,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-02-25 15:44:11,368 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 205 [2019-02-25 15:44:11,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:44:11,371 INFO L225 Difference]: With dead ends: 439 [2019-02-25 15:44:11,371 INFO L226 Difference]: Without dead ends: 325 [2019-02-25 15:44:11,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 376 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1345, Invalid=21005, Unknown=0, NotChecked=0, Total=22350 [2019-02-25 15:44:11,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-02-25 15:44:11,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2019-02-25 15:44:11,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-02-25 15:44:11,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2019-02-25 15:44:11,421 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2019-02-25 15:44:11,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:44:11,422 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2019-02-25 15:44:11,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-25 15:44:11,422 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2019-02-25 15:44:11,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-02-25 15:44:11,423 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:44:11,423 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-02-25 15:44:11,424 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:44:11,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:44:11,424 INFO L82 PathProgramCache]: Analyzing trace with hash -782950827, now seen corresponding path program 50 times [2019-02-25 15:44:11,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:44:11,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:11,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:44:11,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:11,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:44:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:44:12,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:44:12,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:12,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:44:12,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:44:12,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:44:12,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:12,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:44:12,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:44:12,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:44:12,759 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-25 15:44:12,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:44:12,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 62 conjunts are in the unsatisfiable core [2019-02-25 15:44:12,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:44:14,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:44:14,403 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:44:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:44:15,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:44:15,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 91 [2019-02-25 15:44:15,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:44:15,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-25 15:44:15,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-25 15:44:15,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:44:15,657 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 92 states. [2019-02-25 15:44:18,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:44:18,664 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2019-02-25 15:44:18,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-25 15:44:18,665 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 209 [2019-02-25 15:44:18,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:44:18,666 INFO L225 Difference]: With dead ends: 450 [2019-02-25 15:44:18,666 INFO L226 Difference]: Without dead ends: 215 [2019-02-25 15:44:18,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 328 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2019-02-25 15:44:18,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-25 15:44:18,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-02-25 15:44:18,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-25 15:44:18,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2019-02-25 15:44:18,739 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 209 [2019-02-25 15:44:18,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:44:18,739 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2019-02-25 15:44:18,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-25 15:44:18,739 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2019-02-25 15:44:18,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-02-25 15:44:18,741 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:44:18,741 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2019-02-25 15:44:18,741 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:44:18,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:44:18,741 INFO L82 PathProgramCache]: Analyzing trace with hash -890079779, now seen corresponding path program 51 times [2019-02-25 15:44:18,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:44:18,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:18,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:44:18,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:18,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:44:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:44:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:44:20,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:20,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:44:20,898 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:44:20,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:44:20,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:20,898 INFO 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-25 15:44:20,907 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:44:20,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:44:20,962 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:44:20,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:44:20,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 123 conjunts are in the unsatisfiable core [2019-02-25 15:44:20,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:44:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:44:23,742 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:44:23,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:44:24,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:44:24,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 94 [2019-02-25 15:44:24,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:44:24,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-25 15:44:24,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-25 15:44:24,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8680, Unknown=0, NotChecked=0, Total=8930 [2019-02-25 15:44:24,004 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 95 states. [2019-02-25 15:44:34,889 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-25 15:44:35,360 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-25 15:44:35,824 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-25 15:44:36,160 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-25 15:44:36,477 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-25 15:44:36,787 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-25 15:44:37,089 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-25 15:44:37,376 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:44:37,659 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:44:37,930 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:44:38,204 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:44:38,494 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:44:38,769 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:44:39,010 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-25 15:44:41,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:44:41,422 INFO L93 Difference]: Finished difference Result 454 states and 459 transitions. [2019-02-25 15:44:41,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-02-25 15:44:41,422 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 212 [2019-02-25 15:44:41,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:44:41,425 INFO L225 Difference]: With dead ends: 454 [2019-02-25 15:44:41,425 INFO L226 Difference]: Without dead ends: 336 [2019-02-25 15:44:41,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=1421, Invalid=22449, Unknown=0, NotChecked=0, Total=23870 [2019-02-25 15:44:41,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-02-25 15:44:41,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 217. [2019-02-25 15:44:41,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-25 15:44:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2019-02-25 15:44:41,479 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 212 [2019-02-25 15:44:41,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:44:41,480 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2019-02-25 15:44:41,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-25 15:44:41,480 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2019-02-25 15:44:41,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-02-25 15:44:41,481 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:44:41,481 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1] [2019-02-25 15:44:41,481 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:44:41,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:44:41,481 INFO L82 PathProgramCache]: Analyzing trace with hash -272066940, now seen corresponding path program 52 times [2019-02-25 15:44:41,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:44:41,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:41,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:44:41,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:41,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:44:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:44:42,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:44:42,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:42,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:44:42,813 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:44:42,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:44:42,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:42,814 INFO 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-25 15:44:42,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:44:42,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:44:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:44:42,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 64 conjunts are in the unsatisfiable core [2019-02-25 15:44:42,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:44:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:44:44,717 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:44:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:44:45,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:44:45,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 94 [2019-02-25 15:44:45,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:44:45,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-25 15:44:45,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-25 15:44:45,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2019-02-25 15:44:45,960 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 95 states. [2019-02-25 15:44:49,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:44:49,058 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2019-02-25 15:44:49,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-25 15:44:49,058 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 216 [2019-02-25 15:44:49,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:44:49,059 INFO L225 Difference]: With dead ends: 465 [2019-02-25 15:44:49,059 INFO L226 Difference]: Without dead ends: 222 [2019-02-25 15:44:49,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 339 SyntacticMatches, 61 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2019-02-25 15:44:49,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-02-25 15:44:49,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-02-25 15:44:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-02-25 15:44:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2019-02-25 15:44:49,105 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 216 [2019-02-25 15:44:49,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:44:49,105 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2019-02-25 15:44:49,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-25 15:44:49,105 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2019-02-25 15:44:49,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-02-25 15:44:49,106 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:44:49,106 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2019-02-25 15:44:49,107 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:44:49,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:44:49,107 INFO L82 PathProgramCache]: Analyzing trace with hash 292238844, now seen corresponding path program 53 times [2019-02-25 15:44:49,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:44:49,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:49,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:44:49,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:49,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:44:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:44:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 30 proven. 3226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:44:51,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:51,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:44:51,399 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:44:51,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:44:51,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:51,399 INFO 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-25 15:44:51,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:44:51,410 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:44:51,478 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-25 15:44:51,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:44:51,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 68 conjunts are in the unsatisfiable core [2019-02-25 15:44:51,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:44:57,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1800 proven. 1456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:44:57,734 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:45:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1770 proven. 1486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:45:03,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:45:03,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66, 66] total 163 [2019-02-25 15:45:03,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:45:03,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-02-25 15:45:03,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-02-25 15:45:03,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2878, Invalid=23854, Unknown=0, NotChecked=0, Total=26732 [2019-02-25 15:45:03,522 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 131 states. [2019-02-25 15:45:14,250 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-02-25 15:45:28,973 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-25 15:45:29,567 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-25 15:45:30,267 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-25 15:45:30,805 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-25 15:45:31,355 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-25 15:45:31,850 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-25 15:45:32,334 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-25 15:45:32,806 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-25 15:45:33,260 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:45:33,683 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:45:34,105 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:45:34,514 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:45:34,968 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:45:35,354 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:45:39,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:45:39,163 INFO L93 Difference]: Finished difference Result 591 states and 597 transitions. [2019-02-25 15:45:39,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-02-25 15:45:39,164 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 219 [2019-02-25 15:45:39,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:45:39,166 INFO L225 Difference]: With dead ends: 591 [2019-02-25 15:45:39,166 INFO L226 Difference]: Without dead ends: 344 [2019-02-25 15:45:39,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 307 SyntacticMatches, 32 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26556 ImplicationChecksByTransitivity, 40.1s TimeCoverageRelationStatistics Valid=8585, Invalid=113565, Unknown=0, NotChecked=0, Total=122150 [2019-02-25 15:45:39,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-02-25 15:45:39,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2019-02-25 15:45:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-02-25 15:45:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2019-02-25 15:45:39,248 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 219 [2019-02-25 15:45:39,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:45:39,248 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2019-02-25 15:45:39,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-02-25 15:45:39,248 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2019-02-25 15:45:39,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-02-25 15:45:39,250 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:45:39,250 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2019-02-25 15:45:39,250 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:45:39,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:45:39,250 INFO L82 PathProgramCache]: Analyzing trace with hash 2116008107, now seen corresponding path program 54 times [2019-02-25 15:45:39,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:45:39,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:39,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:45:39,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:39,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:45:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:45:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:45:41,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:41,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:45:41,919 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:45:41,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:45:41,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:41,920 INFO 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-25 15:45:41,931 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:45:41,932 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:45:41,970 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:45:41,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:45:41,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 131 conjunts are in the unsatisfiable core [2019-02-25 15:45:41,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:45:44,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:45:44,566 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:45:44,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:45:44,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:45:44,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 100 [2019-02-25 15:45:44,842 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:45:44,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-25 15:45:44,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-25 15:45:44,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=9834, Unknown=0, NotChecked=0, Total=10100 [2019-02-25 15:45:44,843 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 101 states. [2019-02-25 15:45:58,362 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-25 15:45:58,898 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-25 15:45:59,412 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-25 15:45:59,774 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-25 15:46:00,126 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-25 15:46:00,551 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-25 15:46:00,921 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-25 15:46:01,245 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-25 15:46:01,559 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-25 15:46:01,867 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:46:02,160 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:46:02,449 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:46:02,728 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:46:02,988 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:46:03,247 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:46:03,487 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-25 15:46:06,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:46:06,210 INFO L93 Difference]: Finished difference Result 484 states and 489 transitions. [2019-02-25 15:46:06,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-02-25 15:46:06,211 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 226 [2019-02-25 15:46:06,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:46:06,212 INFO L225 Difference]: With dead ends: 484 [2019-02-25 15:46:06,212 INFO L226 Difference]: Without dead ends: 358 [2019-02-25 15:46:06,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=1579, Invalid=25481, Unknown=0, NotChecked=0, Total=27060 [2019-02-25 15:46:06,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-02-25 15:46:06,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 231. [2019-02-25 15:46:06,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-02-25 15:46:06,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2019-02-25 15:46:06,267 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 226 [2019-02-25 15:46:06,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:46:06,267 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2019-02-25 15:46:06,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-25 15:46:06,268 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2019-02-25 15:46:06,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-02-25 15:46:06,269 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:46:06,269 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1] [2019-02-25 15:46:06,269 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:46:06,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:46:06,270 INFO L82 PathProgramCache]: Analyzing trace with hash -237256110, now seen corresponding path program 55 times [2019-02-25 15:46:06,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:46:06,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:06,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:46:06,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:06,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:46:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:46:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:46:07,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:07,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:46:07,840 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:46:07,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:46:07,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:07,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:46:07,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:46:07,850 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:46:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:46:07,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 68 conjunts are in the unsatisfiable core [2019-02-25 15:46:07,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:46:12,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:46:12,230 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:46:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:46:13,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:46:13,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2019-02-25 15:46:13,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:46:13,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-25 15:46:13,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-25 15:46:13,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2019-02-25 15:46:13,899 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 101 states. [2019-02-25 15:46:16,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:46:16,649 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2019-02-25 15:46:16,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-25 15:46:16,649 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 230 [2019-02-25 15:46:16,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:46:16,650 INFO L225 Difference]: With dead ends: 495 [2019-02-25 15:46:16,650 INFO L226 Difference]: Without dead ends: 236 [2019-02-25 15:46:16,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 361 SyntacticMatches, 65 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6272 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2019-02-25 15:46:16,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-02-25 15:46:16,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2019-02-25 15:46:16,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-02-25 15:46:16,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2019-02-25 15:46:16,706 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 230 [2019-02-25 15:46:16,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:46:16,706 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2019-02-25 15:46:16,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-25 15:46:16,707 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2019-02-25 15:46:16,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-02-25 15:46:16,708 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:46:16,708 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2019-02-25 15:46:16,708 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:46:16,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:46:16,709 INFO L82 PathProgramCache]: Analyzing trace with hash -170528822, now seen corresponding path program 56 times [2019-02-25 15:46:16,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:46:16,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:16,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:46:16,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:16,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:46:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:46:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 32 proven. 3665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:46:19,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:19,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:46:19,334 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:46:19,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:46:19,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:19,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 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-25 15:46:19,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:46:19,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:46:19,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-25 15:46:19,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:46:19,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 72 conjunts are in the unsatisfiable core [2019-02-25 15:46:19,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:46:26,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2048 proven. 1649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:46:26,758 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:46:33,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2016 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:46:33,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:46:33,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70, 70] total 173 [2019-02-25 15:46:33,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:46:33,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-02-25 15:46:33,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-02-25 15:46:33,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3227, Invalid=26875, Unknown=0, NotChecked=0, Total=30102 [2019-02-25 15:46:33,220 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 139 states. [2019-02-25 15:46:59,830 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-25 15:47:00,518 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-25 15:47:01,172 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-25 15:47:01,776 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-25 15:47:02,369 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-25 15:47:02,911 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-25 15:47:03,430 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-25 15:47:03,949 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-25 15:47:04,453 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-25 15:47:04,946 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-25 15:47:05,416 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:47:05,888 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:47:06,338 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:47:06,795 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:47:07,221 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:47:07,610 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:47:07,973 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-25 15:47:11,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:47:11,555 INFO L93 Difference]: Finished difference Result 629 states and 635 transitions. [2019-02-25 15:47:11,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-02-25 15:47:11,556 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 233 [2019-02-25 15:47:11,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:47:11,557 INFO L225 Difference]: With dead ends: 629 [2019-02-25 15:47:11,557 INFO L226 Difference]: Without dead ends: 366 [2019-02-25 15:47:11,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 327 SyntacticMatches, 34 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30017 ImplicationChecksByTransitivity, 45.6s TimeCoverageRelationStatistics Valid=9599, Invalid=128413, Unknown=0, NotChecked=0, Total=138012 [2019-02-25 15:47:11,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-25 15:47:11,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2019-02-25 15:47:11,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-02-25 15:47:11,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2019-02-25 15:47:11,618 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 233 [2019-02-25 15:47:11,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:47:11,619 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2019-02-25 15:47:11,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-02-25 15:47:11,619 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2019-02-25 15:47:11,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-02-25 15:47:11,620 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:47:11,620 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2019-02-25 15:47:11,620 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:47:11,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:47:11,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1552518521, now seen corresponding path program 57 times [2019-02-25 15:47:11,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:47:11,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:11,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:47:11,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:11,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:47:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:47:14,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:47:14,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:14,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:47:14,688 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:47:14,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:47:14,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:14,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:47:14,702 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:47:14,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:47:14,742 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:47:14,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:47:14,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 139 conjunts are in the unsatisfiable core [2019-02-25 15:47:14,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:47:17,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:47:17,949 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:47:18,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:47:18,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:47:18,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 106 [2019-02-25 15:47:18,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:47:18,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-25 15:47:18,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-25 15:47:18,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=11060, Unknown=0, NotChecked=0, Total=11342 [2019-02-25 15:47:18,220 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 107 states. [2019-02-25 15:47:30,745 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-25 15:47:31,343 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-25 15:47:31,904 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-25 15:47:32,315 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-25 15:47:32,766 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-25 15:47:33,146 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-25 15:47:33,515 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-25 15:47:33,865 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-25 15:47:34,215 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-25 15:47:34,553 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-25 15:47:34,895 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-25 15:47:35,227 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:47:35,537 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:47:35,856 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:47:36,147 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:47:36,438 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:47:36,708 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:47:36,965 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-25 15:47:37,796 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-02-25 15:47:39,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:47:39,828 INFO L93 Difference]: Finished difference Result 514 states and 519 transitions. [2019-02-25 15:47:39,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-02-25 15:47:39,829 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 240 [2019-02-25 15:47:39,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:47:39,830 INFO L225 Difference]: With dead ends: 514 [2019-02-25 15:47:39,830 INFO L226 Difference]: Without dead ends: 380 [2019-02-25 15:47:39,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=1745, Invalid=28705, Unknown=0, NotChecked=0, Total=30450 [2019-02-25 15:47:39,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-02-25 15:47:39,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 245. [2019-02-25 15:47:39,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-02-25 15:47:39,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2019-02-25 15:47:39,888 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 240 [2019-02-25 15:47:39,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:47:39,888 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2019-02-25 15:47:39,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-25 15:47:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2019-02-25 15:47:39,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-02-25 15:47:39,889 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:47:39,889 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1] [2019-02-25 15:47:39,890 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:47:39,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:47:39,890 INFO L82 PathProgramCache]: Analyzing trace with hash 714244128, now seen corresponding path program 58 times [2019-02-25 15:47:39,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:47:39,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:39,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:47:39,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:39,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:47:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:47:41,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:47:41,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:41,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:47:41,474 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:47:41,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:47:41,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:41,474 INFO 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-25 15:47:41,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:47:41,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:47:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:47:41,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 72 conjunts are in the unsatisfiable core [2019-02-25 15:47:41,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:47:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:47:43,759 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:47:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:47:45,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:47:45,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 106 [2019-02-25 15:47:45,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:47:45,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-25 15:47:45,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-25 15:47:45,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=8716, Unknown=0, NotChecked=0, Total=11342 [2019-02-25 15:47:45,307 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 107 states. [2019-02-25 15:47:48,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:47:48,246 INFO L93 Difference]: Finished difference Result 525 states and 529 transitions. [2019-02-25 15:47:48,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-25 15:47:48,247 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 244 [2019-02-25 15:47:48,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:47:48,248 INFO L225 Difference]: With dead ends: 525 [2019-02-25 15:47:48,248 INFO L226 Difference]: Without dead ends: 250 [2019-02-25 15:47:48,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 383 SyntacticMatches, 69 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7072 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=4586, Invalid=15436, Unknown=0, NotChecked=0, Total=20022 [2019-02-25 15:47:48,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-02-25 15:47:48,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-02-25 15:47:48,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-02-25 15:47:48,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2019-02-25 15:47:48,318 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 244 [2019-02-25 15:47:48,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:47:48,318 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2019-02-25 15:47:48,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-25 15:47:48,318 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2019-02-25 15:47:48,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-02-25 15:47:48,320 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:47:48,320 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2019-02-25 15:47:48,320 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:47:48,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:47:48,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1637071768, now seen corresponding path program 59 times [2019-02-25 15:47:48,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:47:48,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:48,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:47:48,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:48,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:47:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:47:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 34 proven. 4132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:47:51,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:51,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:47:51,257 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:47:51,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:47:51,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:51,258 INFO 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-25 15:47:51,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:47:51,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:47:51,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-25 15:47:51,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:47:51,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 76 conjunts are in the unsatisfiable core [2019-02-25 15:47:51,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:47:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2312 proven. 1854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:47:59,232 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:48:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2278 proven. 1888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:48:06,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:48:06,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74, 74] total 183 [2019-02-25 15:48:06,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:48:06,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-02-25 15:48:06,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-02-25 15:48:06,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=30076, Unknown=0, NotChecked=0, Total=33672 [2019-02-25 15:48:06,580 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 147 states. [2019-02-25 15:48:35,472 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-25 15:48:36,171 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-25 15:48:36,901 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-25 15:48:37,536 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-25 15:48:38,160 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-25 15:48:38,770 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-25 15:48:39,402 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-25 15:48:39,976 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-25 15:48:40,518 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-25 15:48:41,056 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-25 15:48:41,587 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-25 15:48:42,103 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-25 15:48:42,609 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:48:43,095 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:48:43,565 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:48:44,017 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:48:44,506 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:48:44,913 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:48:45,299 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-25 15:48:49,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:48:49,086 INFO L93 Difference]: Finished difference Result 667 states and 673 transitions. [2019-02-25 15:48:49,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-02-25 15:48:49,087 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 247 [2019-02-25 15:48:49,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:48:49,088 INFO L225 Difference]: With dead ends: 667 [2019-02-25 15:48:49,088 INFO L226 Difference]: Without dead ends: 388 [2019-02-25 15:48:49,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 347 SyntacticMatches, 36 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33690 ImplicationChecksByTransitivity, 51.0s TimeCoverageRelationStatistics Valid=10669, Invalid=144173, Unknown=0, NotChecked=0, Total=154842 [2019-02-25 15:48:49,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-02-25 15:48:49,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 255. [2019-02-25 15:48:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-02-25 15:48:49,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2019-02-25 15:48:49,158 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 247 [2019-02-25 15:48:49,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:48:49,159 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2019-02-25 15:48:49,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-02-25 15:48:49,159 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2019-02-25 15:48:49,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-02-25 15:48:49,160 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:48:49,160 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2019-02-25 15:48:49,160 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:48:49,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:48:49,161 INFO L82 PathProgramCache]: Analyzing trace with hash -783420345, now seen corresponding path program 60 times [2019-02-25 15:48:49,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:48:49,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:48:49,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:48:49,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:48:49,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:48:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:48:52,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:48:52,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:48:52,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:48:52,350 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:48:52,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:48:52,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:48:52,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 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-25 15:48:52,362 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:48:52,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:48:52,405 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:48:52,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:48:52,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 147 conjunts are in the unsatisfiable core [2019-02-25 15:48:52,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:48:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:48:55,858 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:48:56,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:48:56,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:48:56,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74, 74] total 112 [2019-02-25 15:48:56,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:48:56,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-25 15:48:56,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-25 15:48:56,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=12358, Unknown=0, NotChecked=0, Total=12656 [2019-02-25 15:48:56,150 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 113 states. [2019-02-25 15:49:10,929 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-25 15:49:11,556 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-25 15:49:12,160 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-25 15:49:12,580 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-25 15:49:13,004 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-25 15:49:13,419 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-25 15:49:13,822 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-25 15:49:14,218 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-25 15:49:14,584 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-25 15:49:15,053 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-25 15:49:15,414 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-25 15:49:15,766 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-25 15:49:16,114 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-25 15:49:16,447 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:49:16,781 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:49:17,095 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:49:17,395 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:49:17,685 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:49:17,982 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:49:21,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:21,273 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2019-02-25 15:49:21,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-02-25 15:49:21,274 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 254 [2019-02-25 15:49:21,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:21,276 INFO L225 Difference]: With dead ends: 544 [2019-02-25 15:49:21,276 INFO L226 Difference]: Without dead ends: 402 [2019-02-25 15:49:21,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5410 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=1919, Invalid=32121, Unknown=0, NotChecked=0, Total=34040 [2019-02-25 15:49:21,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-02-25 15:49:21,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259. [2019-02-25 15:49:21,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-02-25 15:49:21,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2019-02-25 15:49:21,342 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 254 [2019-02-25 15:49:21,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:21,342 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2019-02-25 15:49:21,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-25 15:49:21,343 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2019-02-25 15:49:21,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-02-25 15:49:21,344 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:21,344 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1] [2019-02-25 15:49:21,344 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:21,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:21,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1175113710, now seen corresponding path program 61 times [2019-02-25 15:49:21,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:21,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:21,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:21,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:21,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:23,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:23,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:23,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:23,183 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:23,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:23,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:23,183 INFO 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-25 15:49:23,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:23,195 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:49:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:23,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 76 conjunts are in the unsatisfiable core [2019-02-25 15:49:23,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:25,665 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:27,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:27,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:27,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 112 [2019-02-25 15:49:27,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:27,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-25 15:49:27,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-25 15:49:27,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2019-02-25 15:49:27,364 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 113 states. [2019-02-25 15:49:30,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:30,581 INFO L93 Difference]: Finished difference Result 555 states and 559 transitions. [2019-02-25 15:49:30,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-25 15:49:30,581 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 258 [2019-02-25 15:49:30,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:30,583 INFO L225 Difference]: With dead ends: 555 [2019-02-25 15:49:30,583 INFO L226 Difference]: Without dead ends: 264 [2019-02-25 15:49:30,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 405 SyntacticMatches, 73 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7920 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2019-02-25 15:49:30,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-02-25 15:49:30,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-02-25 15:49:30,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-02-25 15:49:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2019-02-25 15:49:30,647 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2019-02-25 15:49:30,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:30,648 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2019-02-25 15:49:30,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-25 15:49:30,648 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2019-02-25 15:49:30,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-02-25 15:49:30,649 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:30,649 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2019-02-25 15:49:30,649 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:30,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:30,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1470273894, now seen corresponding path program 62 times [2019-02-25 15:49:30,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:30,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:30,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:30,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:30,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:33,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 36 proven. 4627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:33,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:33,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:33,746 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:33,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:33,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:33,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:49:33,756 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:49:33,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:49:33,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-25 15:49:33,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:33,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 80 conjunts are in the unsatisfiable core [2019-02-25 15:49:33,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:42,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2592 proven. 2071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:42,320 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2556 proven. 2107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:50,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:50,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78, 78] total 193 [2019-02-25 15:49:50,176 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:50,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-02-25 15:49:50,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-02-25 15:49:50,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3985, Invalid=33457, Unknown=0, NotChecked=0, Total=37442 [2019-02-25 15:49:50,179 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 155 states. [2019-02-25 15:50:22,930 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-25 15:50:23,703 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-25 15:50:24,487 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-25 15:50:25,185 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-02-25 15:50:25,870 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-25 15:50:26,561 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-25 15:50:27,229 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-25 15:50:27,854 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-25 15:50:28,472 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-25 15:50:29,106 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-25 15:50:29,689 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-25 15:50:30,255 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-25 15:50:30,802 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-25 15:50:31,342 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-25 15:50:31,933 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:50:32,453 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:50:32,946 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:50:33,398 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:50:33,844 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:50:34,277 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:50:34,688 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-25 15:50:38,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:38,735 INFO L93 Difference]: Finished difference Result 705 states and 711 transitions. [2019-02-25 15:50:38,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-02-25 15:50:38,736 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 261 [2019-02-25 15:50:38,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:38,738 INFO L225 Difference]: With dead ends: 705 [2019-02-25 15:50:38,738 INFO L226 Difference]: Without dead ends: 410 [2019-02-25 15:50:38,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 367 SyntacticMatches, 38 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37575 ImplicationChecksByTransitivity, 56.4s TimeCoverageRelationStatistics Valid=11795, Invalid=160845, Unknown=0, NotChecked=0, Total=172640 [2019-02-25 15:50:38,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-02-25 15:50:38,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2019-02-25 15:50:38,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-02-25 15:50:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2019-02-25 15:50:38,866 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 261 [2019-02-25 15:50:38,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:38,866 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2019-02-25 15:50:38,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-02-25 15:50:38,866 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2019-02-25 15:50:38,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-02-25 15:50:38,867 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:38,868 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2019-02-25 15:50:38,868 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:38,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:38,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1569385749, now seen corresponding path program 63 times [2019-02-25 15:50:38,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:38,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:38,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:38,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:38,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:42,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:42,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:42,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:42,227 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:42,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:50:42,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:42,227 INFO 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-25 15:50:42,241 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:50:42,241 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:50:42,286 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:50:42,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:42,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 155 conjunts are in the unsatisfiable core [2019-02-25 15:50:42,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:45,845 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:46,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:46,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78, 78] total 118 [2019-02-25 15:50:46,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:46,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-02-25 15:50:46,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-02-25 15:50:46,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=13728, Unknown=0, NotChecked=0, Total=14042 [2019-02-25 15:50:46,151 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 119 states. [2019-02-25 15:51:03,186 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-02-25 15:51:03,855 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-02-25 15:51:04,512 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-25 15:51:04,981 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-02-25 15:51:05,455 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-02-25 15:51:05,909 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-25 15:51:06,338 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-25 15:51:06,773 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 164