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/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 11:11:25,255 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 11:11:25,257 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 11:11:25,269 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 11:11:25,269 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 11:11:25,270 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 11:11:25,272 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 11:11:25,273 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 11:11:25,275 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 11:11:25,276 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 11:11:25,277 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 11:11:25,277 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 11:11:25,278 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 11:11:25,279 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 11:11:25,281 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 11:11:25,281 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 11:11:25,282 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 11:11:25,284 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 11:11:25,286 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 11:11:25,288 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 11:11:25,289 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 11:11:25,291 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 11:11:25,293 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 11:11:25,294 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 11:11:25,294 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 11:11:25,295 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 11:11:25,296 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 11:11:25,297 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 11:11:25,298 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 11:11:25,299 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 11:11:25,300 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 11:11:25,300 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 11:11:25,301 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 11:11:25,301 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 11:11:25,302 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 11:11:25,303 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 11:11:25,303 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-15 11:11:25,328 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 11:11:25,329 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 11:11:25,330 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 11:11:25,330 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 11:11:25,330 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 11:11:25,331 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 11:11:25,331 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 11:11:25,331 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 11:11:25,331 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 11:11:25,332 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-15 11:11:25,332 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-15 11:11:25,333 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 11:11:25,333 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 11:11:25,334 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 11:11:25,334 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 11:11:25,335 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 11:11:25,335 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 11:11:25,335 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 11:11:25,335 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 11:11:25,336 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 11:11:25,336 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 11:11:25,336 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 11:11:25,336 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 11:11:25,336 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 11:11:25,337 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 11:11:25,338 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 11:11:25,339 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 11:11:25,339 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 11:11:25,339 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 11:11:25,339 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 11:11:25,340 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 11:11:25,340 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 11:11:25,340 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 11:11:25,340 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 11:11:25,341 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 11:11:25,341 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 11:11:25,341 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 11:11:25,341 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 11:11:25,342 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 11:11:25,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 11:11:25,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 11:11:25,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 11:11:25,418 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 11:11:25,419 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 11:11:25,420 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2019-02-15 11:11:25,420 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2019-02-15 11:11:25,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 11:11:25,472 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 11:11:25,473 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 11:11:25,473 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 11:11:25,473 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 11:11:25,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 11:11:25,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 11:11:25,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 11:11:25,511 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 11:11:25,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 11:11:25,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 11:11:25,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 11:11:25,533 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 11:11:25,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (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-15 11:11:25,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 11:11:25,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 11:11:25,883 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 11:11:25,884 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-02-15 11:11:25,886 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:11:25 BoogieIcfgContainer [2019-02-15 11:11:25,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 11:11:25,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 11:11:25,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 11:11:25,891 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 11:11:25,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/2) ... [2019-02-15 11:11:25,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@146b8288 and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:11:25, skipping insertion in model container [2019-02-15 11:11:25,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:11:25" (2/2) ... [2019-02-15 11:11:25,895 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2019-02-15 11:11:25,905 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 11:11:25,913 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-15 11:11:25,931 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-15 11:11:25,964 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 11:11:25,964 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 11:11:25,964 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 11:11:25,965 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 11:11:25,965 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 11:11:25,965 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 11:11:25,965 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 11:11:25,965 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 11:11:25,980 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-15 11:11:25,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:11:25,988 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:25,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:11:25,992 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:25,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:25,998 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-02-15 11:11:26,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:26,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:26,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:26,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:26,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:26,130 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-15 11:11:26,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:11:26,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 11:11:26,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:11:26,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:11:26,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:11:26,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:11:26,152 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-15 11:11:26,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:26,223 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-02-15 11:11:26,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:11:26,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-15 11:11:26,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:26,238 INFO L225 Difference]: With dead ends: 12 [2019-02-15 11:11:26,238 INFO L226 Difference]: Without dead ends: 7 [2019-02-15 11:11:26,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:11:26,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-15 11:11:26,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-15 11:11:26,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-15 11:11:26,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-02-15 11:11:26,288 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-02-15 11:11:26,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:26,288 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-02-15 11:11:26,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:11:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-15 11:11:26,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:11:26,289 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:26,290 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:11:26,290 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:26,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:26,291 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-02-15 11:11:26,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:26,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:26,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:26,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:26,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:26,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:11:26,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:26,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:26,455 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:11:26,458 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-02-15 11:11:26,570 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:11:26,570 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:11:29,193 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:11:29,194 INFO L272 AbstractInterpreter]: Visited 6 different actions 34 times. Merged at 2 different actions 14 times. Widened at 2 different actions 6 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:11:29,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:29,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:11:29,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:29,212 INFO 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-15 11:11:29,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:29,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:29,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:29,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:11:29,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:29,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:11:29,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:29,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-15 11:11:29,508 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:29,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:11:29,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:11:29,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-15 11:11:29,511 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-02-15 11:11:29,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:29,571 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-02-15 11:11:29,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:11:29,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-15 11:11:29,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:29,572 INFO L225 Difference]: With dead ends: 13 [2019-02-15 11:11:29,572 INFO L226 Difference]: Without dead ends: 9 [2019-02-15 11:11:29,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-15 11:11:29,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-15 11:11:29,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-15 11:11:29,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-15 11:11:29,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-02-15 11:11:29,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-02-15 11:11:29,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:29,577 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-02-15 11:11:29,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:11:29,578 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-02-15 11:11:29,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:11:29,578 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:29,579 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-02-15 11:11:29,579 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:29,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:29,580 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-02-15 11:11:29,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:29,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:29,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:29,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:29,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:29,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:11:29,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:29,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:29,679 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:29,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:29,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:29,680 INFO 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-15 11:11:29,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:29,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:29,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-15 11:11:29,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:29,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:29,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:11:29,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:29,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:11:29,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:29,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-02-15 11:11:29,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:29,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-15 11:11:29,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-15 11:11:29,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:11:29,911 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-02-15 11:11:30,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:30,086 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-02-15 11:11:30,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:11:30,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-15 11:11:30,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:30,088 INFO L225 Difference]: With dead ends: 16 [2019-02-15 11:11:30,088 INFO L226 Difference]: Without dead ends: 11 [2019-02-15 11:11:30,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:11:30,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-15 11:11:30,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-15 11:11:30,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-15 11:11:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-02-15 11:11:30,092 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-02-15 11:11:30,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:30,093 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-02-15 11:11:30,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-15 11:11:30,093 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-02-15 11:11:30,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-15 11:11:30,093 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:30,093 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-02-15 11:11:30,094 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:30,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:30,094 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-02-15 11:11:30,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:30,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:30,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:30,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:30,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-15 11:11:30,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:30,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:30,229 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:30,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:30,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:30,229 INFO 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-15 11:11:30,240 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:30,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:30,261 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:30,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:30,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:30,266 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-15 11:11:30,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-15 11:11:30,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:30,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-15 11:11:30,540 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:30,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:11:30,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:11:30,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:11:30,542 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-02-15 11:11:30,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:30,611 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-02-15 11:11:30,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:11:30,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-02-15 11:11:30,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:30,612 INFO L225 Difference]: With dead ends: 19 [2019-02-15 11:11:30,613 INFO L226 Difference]: Without dead ends: 13 [2019-02-15 11:11:30,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:11:30,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-15 11:11:30,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-15 11:11:30,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-15 11:11:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-02-15 11:11:30,616 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-02-15 11:11:30,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:30,616 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-02-15 11:11:30,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:11:30,617 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-02-15 11:11:30,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-15 11:11:30,617 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:30,617 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-02-15 11:11:30,617 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:30,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:30,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-02-15 11:11:30,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:30,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:30,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:30,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:30,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:30,723 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-15 11:11:30,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:30,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:30,724 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:30,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:30,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:30,725 INFO 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-15 11:11:30,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:30,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:30,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:30,766 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-15 11:11:30,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-15 11:11:31,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:31,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-02-15 11:11:31,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:31,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 11:11:31,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 11:11:31,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:11:31,162 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-02-15 11:11:31,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:31,285 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-02-15 11:11:31,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:11:31,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-02-15 11:11:31,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:31,287 INFO L225 Difference]: With dead ends: 22 [2019-02-15 11:11:31,287 INFO L226 Difference]: Without dead ends: 15 [2019-02-15 11:11:31,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:11:31,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-15 11:11:31,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-15 11:11:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-15 11:11:31,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-02-15 11:11:31,293 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-02-15 11:11:31,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:31,294 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-02-15 11:11:31,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 11:11:31,294 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-02-15 11:11:31,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-15 11:11:31,295 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:31,298 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-02-15 11:11:31,298 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:31,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:31,298 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-02-15 11:11:31,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:31,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:31,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:31,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:31,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:31,598 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-15 11:11:31,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:31,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:31,599 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:31,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:31,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:31,600 INFO 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-15 11:11:31,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:31,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:31,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-15 11:11:31,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:31,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:31,647 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-15 11:11:31,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:31,817 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-15 11:11:31,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:31,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-02-15 11:11:31,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:31,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:11:31,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:11:31,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:11:31,840 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-02-15 11:11:31,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:31,880 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-02-15 11:11:31,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:11:31,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-02-15 11:11:31,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:31,881 INFO L225 Difference]: With dead ends: 25 [2019-02-15 11:11:31,882 INFO L226 Difference]: Without dead ends: 17 [2019-02-15 11:11:31,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:11:31,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-15 11:11:31,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-15 11:11:31,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-15 11:11:31,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-02-15 11:11:31,886 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-02-15 11:11:31,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:31,887 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-02-15 11:11:31,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:11:31,887 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-02-15 11:11:31,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-15 11:11:31,887 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:31,888 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-02-15 11:11:31,888 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:31,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:31,888 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-02-15 11:11:31,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:31,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:31,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:31,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:31,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:31,978 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-15 11:11:31,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:31,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:31,979 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:31,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:31,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:31,979 INFO 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-15 11:11:31,997 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:31,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:32,040 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:32,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:32,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-15 11:11:32,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-15 11:11:32,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:32,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-02-15 11:11:32,336 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:32,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:11:32,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:11:32,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:11:32,338 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-02-15 11:11:32,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:32,385 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-02-15 11:11:32,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:11:32,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-02-15 11:11:32,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:32,387 INFO L225 Difference]: With dead ends: 28 [2019-02-15 11:11:32,387 INFO L226 Difference]: Without dead ends: 19 [2019-02-15 11:11:32,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:11:32,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-15 11:11:32,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-15 11:11:32,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-15 11:11:32,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-02-15 11:11:32,392 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-02-15 11:11:32,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:32,392 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-02-15 11:11:32,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:11:32,392 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-02-15 11:11:32,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-15 11:11:32,393 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:32,393 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-02-15 11:11:32,393 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:32,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:32,394 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-02-15 11:11:32,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:32,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:32,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:32,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:32,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-15 11:11:32,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:32,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:32,554 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:32,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:32,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:32,554 INFO 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-15 11:11:32,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:32,568 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:32,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-15 11:11:32,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:32,739 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-15 11:11:32,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:32,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-02-15 11:11:32,758 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:32,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:11:32,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:11:32,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:11:32,759 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-02-15 11:11:32,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:32,795 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-02-15 11:11:32,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:11:32,798 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-02-15 11:11:32,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:32,799 INFO L225 Difference]: With dead ends: 31 [2019-02-15 11:11:32,799 INFO L226 Difference]: Without dead ends: 21 [2019-02-15 11:11:32,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:11:32,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-15 11:11:32,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-15 11:11:32,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-15 11:11:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-02-15 11:11:32,803 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-02-15 11:11:32,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:32,803 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-02-15 11:11:32,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:11:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-02-15 11:11:32,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-15 11:11:32,804 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:32,804 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-02-15 11:11:32,804 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:32,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:32,804 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-02-15 11:11:32,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:32,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:32,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:32,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:32,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-15 11:11:32,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:32,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:32,947 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:32,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:32,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:32,947 INFO 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-15 11:11:32,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:32,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:33,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-15 11:11:33,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:33,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:33,023 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-15 11:11:33,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-15 11:11:33,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:33,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-02-15 11:11:33,296 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:33,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:11:33,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:11:33,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-15 11:11:33,298 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-02-15 11:11:33,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:33,479 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-02-15 11:11:33,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:11:33,479 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-02-15 11:11:33,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:33,480 INFO L225 Difference]: With dead ends: 34 [2019-02-15 11:11:33,480 INFO L226 Difference]: Without dead ends: 23 [2019-02-15 11:11:33,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-15 11:11:33,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-15 11:11:33,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-15 11:11:33,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-15 11:11:33,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-02-15 11:11:33,488 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-02-15 11:11:33,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:33,488 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-02-15 11:11:33,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:11:33,488 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-02-15 11:11:33,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-15 11:11:33,489 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:33,489 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-02-15 11:11:33,489 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:33,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:33,490 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-02-15 11:11:33,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:33,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:33,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:33,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:33,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:33,730 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-15 11:11:33,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:33,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:33,731 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:33,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:33,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:33,732 INFO 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-15 11:11:33,740 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:33,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:33,764 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:33,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:33,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:33,776 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-15 11:11:33,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-15 11:11:34,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:34,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-02-15 11:11:34,227 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:34,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:11:34,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:11:34,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-15 11:11:34,228 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-02-15 11:11:34,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:34,287 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-02-15 11:11:34,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 11:11:34,288 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-02-15 11:11:34,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:34,288 INFO L225 Difference]: With dead ends: 37 [2019-02-15 11:11:34,288 INFO L226 Difference]: Without dead ends: 25 [2019-02-15 11:11:34,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-15 11:11:34,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-15 11:11:34,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-15 11:11:34,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-15 11:11:34,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-02-15 11:11:34,293 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-02-15 11:11:34,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:34,293 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-02-15 11:11:34,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:11:34,294 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-02-15 11:11:34,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-15 11:11:34,294 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:34,294 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-02-15 11:11:34,295 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:34,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:34,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-02-15 11:11:34,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:34,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:34,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:34,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:34,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-15 11:11:34,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:34,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:34,561 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:34,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:34,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:34,561 INFO 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-15 11:11:34,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:34,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:34,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:34,614 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-15 11:11:34,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:34,935 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-15 11:11:34,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:34,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-02-15 11:11:34,954 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:34,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 11:11:34,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 11:11:34,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-15 11:11:34,955 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-02-15 11:11:35,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:35,015 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-02-15 11:11:35,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-15 11:11:35,016 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-02-15 11:11:35,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:35,017 INFO L225 Difference]: With dead ends: 40 [2019-02-15 11:11:35,017 INFO L226 Difference]: Without dead ends: 27 [2019-02-15 11:11:35,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-15 11:11:35,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-15 11:11:35,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-15 11:11:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-15 11:11:35,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-02-15 11:11:35,021 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-02-15 11:11:35,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:35,022 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-02-15 11:11:35,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 11:11:35,022 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-02-15 11:11:35,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-15 11:11:35,023 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:35,023 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-02-15 11:11:35,023 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:35,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:35,023 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-02-15 11:11:35,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:35,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:35,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:35,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:35,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:35,199 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-15 11:11:35,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:35,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:35,200 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:35,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:35,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:35,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:11:35,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:35,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:35,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-15 11:11:35,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:35,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-15 11:11:35,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-15 11:11:35,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:35,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-02-15 11:11:35,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:35,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 11:11:35,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 11:11:35,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-15 11:11:35,603 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-02-15 11:11:35,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:35,680 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-02-15 11:11:35,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-15 11:11:35,681 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-02-15 11:11:35,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:35,682 INFO L225 Difference]: With dead ends: 43 [2019-02-15 11:11:35,682 INFO L226 Difference]: Without dead ends: 29 [2019-02-15 11:11:35,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-15 11:11:35,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-15 11:11:35,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-15 11:11:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-15 11:11:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-02-15 11:11:35,688 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-02-15 11:11:35,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:35,688 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-02-15 11:11:35,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 11:11:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-02-15 11:11:35,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-15 11:11:35,689 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:35,689 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-02-15 11:11:35,689 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:35,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:35,690 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-02-15 11:11:35,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:35,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:35,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:35,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:35,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:36,007 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-15 11:11:36,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:36,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:36,008 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:36,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:36,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:36,008 INFO 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-15 11:11:36,017 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:36,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:36,042 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:36,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:36,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:36,050 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-15 11:11:36,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:36,256 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-15 11:11:36,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:36,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-02-15 11:11:36,275 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:36,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-15 11:11:36,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-15 11:11:36,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-15 11:11:36,278 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-02-15 11:11:36,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:36,373 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-02-15 11:11:36,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-15 11:11:36,374 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-02-15 11:11:36,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:36,375 INFO L225 Difference]: With dead ends: 46 [2019-02-15 11:11:36,375 INFO L226 Difference]: Without dead ends: 31 [2019-02-15 11:11:36,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-15 11:11:36,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-15 11:11:36,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-15 11:11:36,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-15 11:11:36,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-02-15 11:11:36,381 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-02-15 11:11:36,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:36,381 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-02-15 11:11:36,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-15 11:11:36,381 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-02-15 11:11:36,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-15 11:11:36,382 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:36,382 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-02-15 11:11:36,382 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:36,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:36,383 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-02-15 11:11:36,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:36,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:36,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:36,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:36,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:36,543 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-15 11:11:36,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:36,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:36,544 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:36,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:36,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:36,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:11:36,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:36,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:36,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:36,597 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-15 11:11:36,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:36,961 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-15 11:11:36,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:36,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-02-15 11:11:36,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:36,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-15 11:11:36,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-15 11:11:36,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-15 11:11:36,982 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-02-15 11:11:37,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:37,053 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-02-15 11:11:37,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-15 11:11:37,054 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-02-15 11:11:37,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:37,055 INFO L225 Difference]: With dead ends: 49 [2019-02-15 11:11:37,055 INFO L226 Difference]: Without dead ends: 33 [2019-02-15 11:11:37,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-15 11:11:37,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-15 11:11:37,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-15 11:11:37,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-15 11:11:37,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-02-15 11:11:37,060 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-02-15 11:11:37,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:37,060 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-02-15 11:11:37,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-15 11:11:37,060 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-02-15 11:11:37,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-15 11:11:37,061 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:37,061 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-02-15 11:11:37,062 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:37,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:37,062 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-02-15 11:11:37,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:37,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:37,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:37,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:37,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:37,281 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-15 11:11:37,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:37,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:37,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:37,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:37,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:37,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:11:37,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:37,292 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:37,335 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-15 11:11:37,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:37,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:37,344 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-15 11:11:37,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-15 11:11:37,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:37,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-02-15 11:11:37,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:37,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-15 11:11:37,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-15 11:11:37,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-15 11:11:37,671 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-02-15 11:11:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:37,740 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-02-15 11:11:37,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-15 11:11:37,741 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-02-15 11:11:37,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:37,742 INFO L225 Difference]: With dead ends: 52 [2019-02-15 11:11:37,742 INFO L226 Difference]: Without dead ends: 35 [2019-02-15 11:11:37,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-15 11:11:37,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-15 11:11:37,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-15 11:11:37,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-15 11:11:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-02-15 11:11:37,747 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-02-15 11:11:37,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:37,747 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-02-15 11:11:37,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-15 11:11:37,747 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-02-15 11:11:37,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-15 11:11:37,748 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:37,748 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-02-15 11:11:37,748 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:37,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:37,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-02-15 11:11:37,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:37,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:37,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:37,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:37,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:37,953 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-15 11:11:37,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:37,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:37,953 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:37,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:37,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:37,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 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-15 11:11:37,963 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:37,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:37,987 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:37,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:37,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:37,996 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-15 11:11:37,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:38,472 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-15 11:11:38,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:38,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-02-15 11:11:38,491 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:38,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-15 11:11:38,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-15 11:11:38,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-15 11:11:38,492 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-02-15 11:11:38,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:38,603 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-02-15 11:11:38,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-15 11:11:38,603 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-02-15 11:11:38,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:38,604 INFO L225 Difference]: With dead ends: 55 [2019-02-15 11:11:38,604 INFO L226 Difference]: Without dead ends: 37 [2019-02-15 11:11:38,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-15 11:11:38,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-15 11:11:38,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-15 11:11:38,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-15 11:11:38,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-02-15 11:11:38,611 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-02-15 11:11:38,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:38,612 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-02-15 11:11:38,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-15 11:11:38,612 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-02-15 11:11:38,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-15 11:11:38,613 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:38,613 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-02-15 11:11:38,613 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:38,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:38,613 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-02-15 11:11:38,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:38,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:38,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:38,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:38,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:39,251 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-15 11:11:39,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:39,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:39,252 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:39,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:39,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:39,252 INFO 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-15 11:11:39,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:39,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:39,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:39,295 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-15 11:11:39,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:39,961 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-15 11:11:39,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:39,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-02-15 11:11:39,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:39,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-15 11:11:39,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-15 11:11:39,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-15 11:11:39,982 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-02-15 11:11:40,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:40,043 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-02-15 11:11:40,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-15 11:11:40,044 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-02-15 11:11:40,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:40,045 INFO L225 Difference]: With dead ends: 58 [2019-02-15 11:11:40,045 INFO L226 Difference]: Without dead ends: 39 [2019-02-15 11:11:40,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-15 11:11:40,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-15 11:11:40,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-15 11:11:40,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-15 11:11:40,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-02-15 11:11:40,050 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-02-15 11:11:40,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:40,050 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-02-15 11:11:40,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-15 11:11:40,050 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-02-15 11:11:40,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-15 11:11:40,051 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:40,051 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-02-15 11:11:40,051 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:40,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:40,052 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-02-15 11:11:40,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:40,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:40,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:40,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:40,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-15 11:11:40,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:40,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:40,245 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:40,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:40,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:40,246 INFO 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-15 11:11:40,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:40,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:40,305 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-15 11:11:40,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:40,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:40,315 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-15 11:11:40,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:41,043 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-15 11:11:41,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:41,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-02-15 11:11:41,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:41,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-15 11:11:41,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-15 11:11:41,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-15 11:11:41,063 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-02-15 11:11:41,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:41,146 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-02-15 11:11:41,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-15 11:11:41,147 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-02-15 11:11:41,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:41,148 INFO L225 Difference]: With dead ends: 61 [2019-02-15 11:11:41,148 INFO L226 Difference]: Without dead ends: 41 [2019-02-15 11:11:41,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-15 11:11:41,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-15 11:11:41,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-15 11:11:41,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-15 11:11:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-02-15 11:11:41,153 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-02-15 11:11:41,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:41,153 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-02-15 11:11:41,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-15 11:11:41,153 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-02-15 11:11:41,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-15 11:11:41,154 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:41,154 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-02-15 11:11:41,154 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:41,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:41,155 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-02-15 11:11:41,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:41,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:41,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:41,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:41,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:41,865 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-15 11:11:41,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:41,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:41,866 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:41,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:41,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:41,866 INFO 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-15 11:11:41,883 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:41,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:41,937 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:41,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:41,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-15 11:11:41,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:42,445 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-15 11:11:42,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:42,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-02-15 11:11:42,465 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:42,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-15 11:11:42,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-15 11:11:42,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-15 11:11:42,467 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-02-15 11:11:42,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:42,632 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-02-15 11:11:42,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-15 11:11:42,633 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-02-15 11:11:42,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:42,633 INFO L225 Difference]: With dead ends: 64 [2019-02-15 11:11:42,633 INFO L226 Difference]: Without dead ends: 43 [2019-02-15 11:11:42,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-15 11:11:42,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-15 11:11:42,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-15 11:11:42,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-15 11:11:42,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-02-15 11:11:42,640 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-02-15 11:11:42,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:42,640 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-02-15 11:11:42,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-15 11:11:42,640 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-02-15 11:11:42,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-15 11:11:42,641 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:42,641 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-02-15 11:11:42,641 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:42,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:42,641 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-02-15 11:11:42,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:42,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:42,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:42,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:42,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:43,446 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-15 11:11:43,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:43,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:43,447 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:43,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:43,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:43,447 INFO 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-15 11:11:43,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:43,460 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:43,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-15 11:11:43,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-15 11:11:43,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:43,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-02-15 11:11:43,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:43,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-15 11:11:43,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-15 11:11:43,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-15 11:11:43,973 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-02-15 11:11:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:44,064 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-02-15 11:11:44,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-15 11:11:44,064 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-02-15 11:11:44,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:44,065 INFO L225 Difference]: With dead ends: 67 [2019-02-15 11:11:44,065 INFO L226 Difference]: Without dead ends: 45 [2019-02-15 11:11:44,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-15 11:11:44,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-15 11:11:44,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-15 11:11:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-15 11:11:44,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-02-15 11:11:44,070 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-02-15 11:11:44,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:44,070 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-02-15 11:11:44,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-15 11:11:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-02-15 11:11:44,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-15 11:11:44,071 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:44,071 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-02-15 11:11:44,071 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:44,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:44,072 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-02-15 11:11:44,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:44,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:44,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:44,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:44,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-15 11:11:44,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:44,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:44,635 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:44,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:44,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:44,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:11:44,645 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:44,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:44,710 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-15 11:11:44,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:44,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:44,718 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-15 11:11:44,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:45,513 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-15 11:11:45,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:45,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-02-15 11:11:45,534 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:45,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-15 11:11:45,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-15 11:11:45,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-15 11:11:45,536 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-02-15 11:11:45,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:45,613 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-02-15 11:11:45,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-15 11:11:45,613 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-02-15 11:11:45,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:45,614 INFO L225 Difference]: With dead ends: 70 [2019-02-15 11:11:45,614 INFO L226 Difference]: Without dead ends: 47 [2019-02-15 11:11:45,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-15 11:11:45,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-15 11:11:45,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-15 11:11:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-15 11:11:45,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-02-15 11:11:45,620 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-02-15 11:11:45,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:45,620 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-02-15 11:11:45,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-15 11:11:45,620 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-02-15 11:11:45,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-15 11:11:45,621 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:45,621 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-02-15 11:11:45,621 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:45,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:45,621 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-02-15 11:11:45,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:45,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:45,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:45,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:45,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:45,949 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-15 11:11:45,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:45,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:45,950 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:45,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:45,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:45,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:11:45,961 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:45,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:45,996 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:45,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:46,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-15 11:11:46,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-15 11:11:46,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:46,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-02-15 11:11:46,607 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:46,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-15 11:11:46,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-15 11:11:46,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-15 11:11:46,608 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-02-15 11:11:46,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:46,692 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-02-15 11:11:46,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-15 11:11:46,694 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-02-15 11:11:46,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:46,695 INFO L225 Difference]: With dead ends: 73 [2019-02-15 11:11:46,695 INFO L226 Difference]: Without dead ends: 49 [2019-02-15 11:11:46,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-15 11:11:46,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-15 11:11:46,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-15 11:11:46,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-15 11:11:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-02-15 11:11:46,700 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-02-15 11:11:46,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:46,701 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-02-15 11:11:46,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-15 11:11:46,701 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-02-15 11:11:46,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-15 11:11:46,701 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:46,702 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-02-15 11:11:46,702 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:46,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:46,702 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-02-15 11:11:46,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:46,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:46,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:46,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:46,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:47,084 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-15 11:11:47,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:47,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:47,085 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:47,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:47,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:47,085 INFO 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-15 11:11:47,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:47,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:47,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-15 11:11:47,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-15 11:11:47,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:47,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-02-15 11:11:47,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:47,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-15 11:11:47,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-15 11:11:47,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-15 11:11:47,815 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-02-15 11:11:47,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:47,938 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-02-15 11:11:47,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-15 11:11:47,941 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-02-15 11:11:47,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:47,941 INFO L225 Difference]: With dead ends: 76 [2019-02-15 11:11:47,941 INFO L226 Difference]: Without dead ends: 51 [2019-02-15 11:11:47,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-15 11:11:47,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-15 11:11:47,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-15 11:11:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-15 11:11:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-02-15 11:11:47,946 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-02-15 11:11:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:47,946 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-02-15 11:11:47,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-15 11:11:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-02-15 11:11:47,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-15 11:11:47,947 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:47,947 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-02-15 11:11:47,947 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:47,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:47,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-02-15 11:11:47,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:47,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:47,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:47,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:47,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-15 11:11:48,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:48,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:48,251 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:48,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:48,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:48,251 INFO 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-15 11:11:48,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:48,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:48,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-15 11:11:48,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:48,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:48,354 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-15 11:11:48,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:48,990 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-15 11:11:49,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:49,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-02-15 11:11:49,015 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:49,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-15 11:11:49,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-15 11:11:49,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-15 11:11:49,017 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-02-15 11:11:49,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:49,104 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-02-15 11:11:49,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-15 11:11:49,104 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-02-15 11:11:49,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:49,105 INFO L225 Difference]: With dead ends: 79 [2019-02-15 11:11:49,105 INFO L226 Difference]: Without dead ends: 53 [2019-02-15 11:11:49,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-15 11:11:49,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-15 11:11:49,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-15 11:11:49,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-15 11:11:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-02-15 11:11:49,109 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-02-15 11:11:49,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:49,110 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-02-15 11:11:49,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-15 11:11:49,110 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-02-15 11:11:49,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-15 11:11:49,110 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:49,110 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-02-15 11:11:49,110 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:49,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:49,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-02-15 11:11:49,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:49,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:49,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:49,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:49,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:49,967 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-15 11:11:49,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:49,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:49,967 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:49,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:49,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:49,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 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-15 11:11:49,979 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:49,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:50,026 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:50,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:50,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:50,035 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-15 11:11:50,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:51,364 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-15 11:11:51,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:51,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-02-15 11:11:51,383 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:51,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-15 11:11:51,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-15 11:11:51,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-15 11:11:51,385 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-02-15 11:11:51,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:51,505 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-02-15 11:11:51,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-15 11:11:51,506 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-02-15 11:11:51,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:51,506 INFO L225 Difference]: With dead ends: 82 [2019-02-15 11:11:51,506 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 11:11:51,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-15 11:11:51,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 11:11:51,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-15 11:11:51,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-15 11:11:51,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-02-15 11:11:51,511 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-02-15 11:11:51,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:51,511 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-02-15 11:11:51,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-15 11:11:51,512 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-02-15 11:11:51,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-15 11:11:51,512 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:51,512 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-02-15 11:11:51,513 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:51,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:51,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-02-15 11:11:51,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:51,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:51,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:51,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:51,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:52,210 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-15 11:11:52,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:52,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:52,211 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:52,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:52,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:52,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 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-15 11:11:52,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:52,220 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:52,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-15 11:11:52,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:52,984 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-15 11:11:53,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:53,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-02-15 11:11:53,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:53,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-15 11:11:53,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-15 11:11:53,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-15 11:11:53,006 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-02-15 11:11:53,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:53,134 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-02-15 11:11:53,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-15 11:11:53,134 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-02-15 11:11:53,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:53,135 INFO L225 Difference]: With dead ends: 85 [2019-02-15 11:11:53,135 INFO L226 Difference]: Without dead ends: 57 [2019-02-15 11:11:53,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-15 11:11:53,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-15 11:11:53,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-15 11:11:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-15 11:11:53,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-02-15 11:11:53,139 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-02-15 11:11:53,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:53,139 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-02-15 11:11:53,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-15 11:11:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-02-15 11:11:53,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-15 11:11:53,140 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:53,140 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-02-15 11:11:53,140 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:53,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:53,141 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-02-15 11:11:53,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:53,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:53,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:53,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:53,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:53,534 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-15 11:11:53,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:53,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:53,534 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:53,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:53,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:53,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:11:53,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:53,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:53,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-15 11:11:53,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:53,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:53,662 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-15 11:11:53,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:54,603 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-15 11:11:54,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:54,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-02-15 11:11:54,622 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:54,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-15 11:11:54,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-15 11:11:54,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-15 11:11:54,625 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-02-15 11:11:54,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:54,749 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-02-15 11:11:54,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-15 11:11:54,749 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-02-15 11:11:54,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:54,750 INFO L225 Difference]: With dead ends: 88 [2019-02-15 11:11:54,750 INFO L226 Difference]: Without dead ends: 59 [2019-02-15 11:11:54,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-15 11:11:54,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-15 11:11:54,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-15 11:11:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-15 11:11:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-02-15 11:11:54,754 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-02-15 11:11:54,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:54,754 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-02-15 11:11:54,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-15 11:11:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-02-15 11:11:54,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-15 11:11:54,755 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:54,755 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-02-15 11:11:54,755 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:54,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:54,756 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-02-15 11:11:54,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:54,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:54,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:54,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:54,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:55,397 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-15 11:11:55,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:55,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:55,398 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:55,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:55,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:55,398 INFO 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-15 11:11:55,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:55,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:55,445 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:55,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:55,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:55,456 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-15 11:11:55,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:56,424 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-15 11:11:56,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:56,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-02-15 11:11:56,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:56,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-15 11:11:56,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-15 11:11:56,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-15 11:11:56,445 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-02-15 11:11:56,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:56,574 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-02-15 11:11:56,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-15 11:11:56,574 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-02-15 11:11:56,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:56,575 INFO L225 Difference]: With dead ends: 91 [2019-02-15 11:11:56,575 INFO L226 Difference]: Without dead ends: 61 [2019-02-15 11:11:56,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-15 11:11:56,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-15 11:11:56,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-15 11:11:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-15 11:11:56,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-02-15 11:11:56,579 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-02-15 11:11:56,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:56,579 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-02-15 11:11:56,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-15 11:11:56,579 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-02-15 11:11:56,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-15 11:11:56,580 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:56,580 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-02-15 11:11:56,580 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:56,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:56,580 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-02-15 11:11:56,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:56,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:56,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:56,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:56,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-15 11:11:57,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:57,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:57,183 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:57,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:57,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:57,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 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-15 11:11:57,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:57,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:57,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:57,256 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-15 11:11:57,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-15 11:11:58,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:58,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-02-15 11:11:58,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:58,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-15 11:11:58,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-15 11:11:58,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-15 11:11:58,311 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-02-15 11:11:58,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:58,434 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-02-15 11:11:58,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-15 11:11:58,435 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-02-15 11:11:58,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:58,436 INFO L225 Difference]: With dead ends: 94 [2019-02-15 11:11:58,436 INFO L226 Difference]: Without dead ends: 63 [2019-02-15 11:11:58,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-15 11:11:58,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-15 11:11:58,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-15 11:11:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-15 11:11:58,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-02-15 11:11:58,440 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-02-15 11:11:58,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:58,440 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-02-15 11:11:58,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-15 11:11:58,440 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-02-15 11:11:58,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-15 11:11:58,441 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:58,441 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-02-15 11:11:58,441 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:58,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:58,441 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-02-15 11:11:58,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:58,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:58,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:58,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:58,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-15 11:11:58,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:58,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:58,879 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:58,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:58,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:58,879 INFO 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-15 11:11:58,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:58,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:59,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-15 11:11:59,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:59,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:59,058 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-15 11:11:59,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-15 11:12:00,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:00,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-02-15 11:12:00,316 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:00,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-15 11:12:00,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-15 11:12:00,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-15 11:12:00,318 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-02-15 11:12:00,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:00,539 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-02-15 11:12:00,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-15 11:12:00,540 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-02-15 11:12:00,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:00,541 INFO L225 Difference]: With dead ends: 97 [2019-02-15 11:12:00,541 INFO L226 Difference]: Without dead ends: 65 [2019-02-15 11:12:00,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-15 11:12:00,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-15 11:12:00,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-15 11:12:00,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-15 11:12:00,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-02-15 11:12:00,544 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-02-15 11:12:00,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:00,545 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-02-15 11:12:00,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-15 11:12:00,545 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-02-15 11:12:00,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-15 11:12:00,545 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:00,545 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-02-15 11:12:00,545 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:00,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:00,546 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-02-15 11:12:00,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:00,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:00,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:00,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:00,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:01,173 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-15 11:12:01,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:01,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:01,173 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:01,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:01,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:01,174 INFO 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-15 11:12:01,184 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:01,184 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:01,227 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:01,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:01,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-15 11:12:01,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-15 11:12:02,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:02,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-02-15 11:12:02,303 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:02,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-15 11:12:02,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-15 11:12:02,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-15 11:12:02,304 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-02-15 11:12:02,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:02,462 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-02-15 11:12:02,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-15 11:12:02,462 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-02-15 11:12:02,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:02,463 INFO L225 Difference]: With dead ends: 100 [2019-02-15 11:12:02,463 INFO L226 Difference]: Without dead ends: 67 [2019-02-15 11:12:02,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-15 11:12:02,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-15 11:12:02,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-15 11:12:02,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-15 11:12:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-02-15 11:12:02,468 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-02-15 11:12:02,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:02,468 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-02-15 11:12:02,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-15 11:12:02,468 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-02-15 11:12:02,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-15 11:12:02,469 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:02,469 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-02-15 11:12:02,469 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:02,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:02,469 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-02-15 11:12:02,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:02,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:02,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:02,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:02,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:02,967 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-15 11:12:02,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:02,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:02,967 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:02,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:02,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:02,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 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-15 11:12:02,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:02,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:03,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-15 11:12:03,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:04,135 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-15 11:12:04,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:04,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-02-15 11:12:04,154 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:04,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-15 11:12:04,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-15 11:12:04,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-15 11:12:04,156 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-02-15 11:12:04,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:04,289 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-02-15 11:12:04,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-15 11:12:04,290 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-02-15 11:12:04,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:04,291 INFO L225 Difference]: With dead ends: 103 [2019-02-15 11:12:04,291 INFO L226 Difference]: Without dead ends: 69 [2019-02-15 11:12:04,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-15 11:12:04,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-15 11:12:04,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-15 11:12:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-15 11:12:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-02-15 11:12:04,295 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-02-15 11:12:04,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:04,295 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-02-15 11:12:04,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-15 11:12:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-02-15 11:12:04,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-15 11:12:04,296 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:04,296 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-02-15 11:12:04,296 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:04,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:04,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-02-15 11:12:04,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:04,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:04,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:04,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:04,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-15 11:12:05,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:05,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:05,385 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:05,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:05,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:05,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:12:05,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:05,394 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:05,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-15 11:12:05,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:05,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:05,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-15 11:12:05,570 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-15 11:12:06,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:06,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-02-15 11:12:06,762 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:06,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-15 11:12:06,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-15 11:12:06,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-15 11:12:06,764 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-02-15 11:12:06,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:06,926 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-02-15 11:12:06,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-15 11:12:06,927 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-02-15 11:12:06,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:06,928 INFO L225 Difference]: With dead ends: 106 [2019-02-15 11:12:06,928 INFO L226 Difference]: Without dead ends: 71 [2019-02-15 11:12:06,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-15 11:12:06,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-15 11:12:06,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-15 11:12:06,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-15 11:12:06,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-02-15 11:12:06,932 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-02-15 11:12:06,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:06,932 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-02-15 11:12:06,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-15 11:12:06,932 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-02-15 11:12:06,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-15 11:12:06,933 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:06,933 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-02-15 11:12:06,933 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:06,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:06,933 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-02-15 11:12:06,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:06,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:06,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:06,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:06,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:07,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-15 11:12:07,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:07,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:07,441 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:07,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:07,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:07,441 INFO 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-15 11:12:07,450 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:07,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:07,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:07,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:07,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-15 11:12:07,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:08,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-15 11:12:08,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:08,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-02-15 11:12:08,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:08,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-15 11:12:08,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-15 11:12:08,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-15 11:12:08,819 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-02-15 11:12:08,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:08,983 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-02-15 11:12:08,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-15 11:12:08,984 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-02-15 11:12:08,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:08,985 INFO L225 Difference]: With dead ends: 109 [2019-02-15 11:12:08,985 INFO L226 Difference]: Without dead ends: 73 [2019-02-15 11:12:08,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-15 11:12:08,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-15 11:12:08,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-15 11:12:08,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-15 11:12:08,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-02-15 11:12:08,988 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-02-15 11:12:08,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:08,988 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-02-15 11:12:08,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-15 11:12:08,988 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-02-15 11:12:08,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-15 11:12:08,989 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:08,989 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-02-15 11:12:08,989 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:08,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:08,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-02-15 11:12:08,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:08,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:08,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:08,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:08,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:10,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-15 11:12:10,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:10,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:10,012 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:10,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:10,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:10,012 INFO 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-15 11:12:10,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:10,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:10,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-15 11:12:10,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:11,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-15 11:12:11,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:11,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-02-15 11:12:11,384 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:11,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-15 11:12:11,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-15 11:12:11,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-15 11:12:11,385 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-02-15 11:12:11,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:11,631 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-02-15 11:12:11,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-15 11:12:11,632 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-02-15 11:12:11,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:11,633 INFO L225 Difference]: With dead ends: 112 [2019-02-15 11:12:11,633 INFO L226 Difference]: Without dead ends: 75 [2019-02-15 11:12:11,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-15 11:12:11,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-15 11:12:11,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-15 11:12:11,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-15 11:12:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-02-15 11:12:11,637 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-02-15 11:12:11,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:11,638 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-02-15 11:12:11,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-15 11:12:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-02-15 11:12:11,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-15 11:12:11,638 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:11,639 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-02-15 11:12:11,639 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:11,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:11,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-02-15 11:12:11,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:11,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:11,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:11,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:11,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-15 11:12:12,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:12,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:12,231 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:12,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:12,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:12,231 INFO 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-15 11:12:12,239 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:12,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:12,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-15 11:12:12,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:12,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:12,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-15 11:12:12,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:14,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-15 11:12:14,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:14,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-02-15 11:12:14,058 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:14,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-15 11:12:14,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-15 11:12:14,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-15 11:12:14,059 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-02-15 11:12:14,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:14,190 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-02-15 11:12:14,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-15 11:12:14,191 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-02-15 11:12:14,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:14,191 INFO L225 Difference]: With dead ends: 115 [2019-02-15 11:12:14,192 INFO L226 Difference]: Without dead ends: 77 [2019-02-15 11:12:14,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-15 11:12:14,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-15 11:12:14,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-15 11:12:14,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-15 11:12:14,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-02-15 11:12:14,195 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-02-15 11:12:14,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:14,195 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-02-15 11:12:14,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-15 11:12:14,196 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-02-15 11:12:14,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-15 11:12:14,196 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:14,196 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-02-15 11:12:14,196 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:14,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:14,196 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-02-15 11:12:14,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:14,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:14,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:14,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:14,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:14,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-15 11:12:14,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:14,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:14,946 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:14,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:14,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:14,946 INFO 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-15 11:12:14,954 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:14,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:15,013 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:15,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:15,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:15,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-15 11:12:15,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:16,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-15 11:12:16,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:16,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-02-15 11:12:16,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:16,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-15 11:12:16,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-15 11:12:16,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-15 11:12:16,525 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-02-15 11:12:16,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:16,675 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-02-15 11:12:16,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-15 11:12:16,676 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-02-15 11:12:16,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:16,676 INFO L225 Difference]: With dead ends: 118 [2019-02-15 11:12:16,677 INFO L226 Difference]: Without dead ends: 79 [2019-02-15 11:12:16,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-15 11:12:16,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-15 11:12:16,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-15 11:12:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-15 11:12:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-02-15 11:12:16,679 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-02-15 11:12:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:16,679 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-02-15 11:12:16,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-15 11:12:16,680 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-02-15 11:12:16,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-15 11:12:16,680 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:16,680 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-02-15 11:12:16,681 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:16,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:16,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-02-15 11:12:16,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:16,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:16,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:16,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:16,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-15 11:12:17,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:17,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:17,316 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:17,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:17,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:17,317 INFO 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-15 11:12:17,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:17,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:17,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:17,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-15 11:12:17,387 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-15 11:12:19,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:19,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-02-15 11:12:19,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:19,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-15 11:12:19,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-15 11:12:19,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-15 11:12:19,059 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-02-15 11:12:19,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:19,206 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-02-15 11:12:19,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-15 11:12:19,206 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-02-15 11:12:19,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:19,207 INFO L225 Difference]: With dead ends: 121 [2019-02-15 11:12:19,207 INFO L226 Difference]: Without dead ends: 81 [2019-02-15 11:12:19,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-15 11:12:19,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-15 11:12:19,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-15 11:12:19,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-15 11:12:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-02-15 11:12:19,210 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-02-15 11:12:19,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:19,210 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-02-15 11:12:19,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-15 11:12:19,210 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-02-15 11:12:19,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-15 11:12:19,210 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:19,211 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-02-15 11:12:19,211 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:19,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:19,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-02-15 11:12:19,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:19,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:19,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:19,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:19,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:20,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-15 11:12:20,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:20,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:20,305 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:20,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:20,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:20,305 INFO 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-15 11:12:20,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:20,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:20,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-15 11:12:20,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:20,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-15 11:12:20,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:22,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-15 11:12:22,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:22,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-02-15 11:12:22,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:22,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-15 11:12:22,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-15 11:12:22,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-15 11:12:22,354 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-02-15 11:12:22,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:22,510 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-02-15 11:12:22,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-15 11:12:22,510 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-02-15 11:12:22,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:22,511 INFO L225 Difference]: With dead ends: 124 [2019-02-15 11:12:22,511 INFO L226 Difference]: Without dead ends: 83 [2019-02-15 11:12:22,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-15 11:12:22,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-15 11:12:22,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-15 11:12:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-15 11:12:22,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-02-15 11:12:22,514 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-02-15 11:12:22,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:22,514 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-02-15 11:12:22,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-15 11:12:22,515 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-02-15 11:12:22,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-15 11:12:22,515 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:22,515 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-02-15 11:12:22,515 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:22,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:22,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-02-15 11:12:22,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:22,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:22,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:22,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:22,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-15 11:12:23,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:23,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:23,239 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:23,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:23,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:23,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:12:23,249 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:23,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:23,327 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:23,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:23,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-15 11:12:23,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:25,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-15 11:12:25,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:25,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-02-15 11:12:25,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:25,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-15 11:12:25,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-15 11:12:25,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-15 11:12:25,032 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-02-15 11:12:25,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:25,256 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-02-15 11:12:25,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-15 11:12:25,256 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-02-15 11:12:25,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:25,257 INFO L225 Difference]: With dead ends: 127 [2019-02-15 11:12:25,257 INFO L226 Difference]: Without dead ends: 85 [2019-02-15 11:12:25,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-15 11:12:25,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-15 11:12:25,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-15 11:12:25,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-15 11:12:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-02-15 11:12:25,260 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-02-15 11:12:25,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:25,260 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-02-15 11:12:25,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-15 11:12:25,261 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-02-15 11:12:25,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-15 11:12:25,261 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:25,261 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-02-15 11:12:25,261 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:25,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:25,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-02-15 11:12:25,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:25,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:25,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:25,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:25,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:26,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-15 11:12:26,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:26,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:26,076 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:26,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:26,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:26,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:12:26,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:26,085 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:26,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:26,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-15 11:12:26,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:27,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-15 11:12:27,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:27,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-02-15 11:12:27,990 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:27,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-15 11:12:27,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-15 11:12:27,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-15 11:12:27,991 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-02-15 11:12:28,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:28,150 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-02-15 11:12:28,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-15 11:12:28,150 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-02-15 11:12:28,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:28,151 INFO L225 Difference]: With dead ends: 130 [2019-02-15 11:12:28,151 INFO L226 Difference]: Without dead ends: 87 [2019-02-15 11:12:28,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-15 11:12:28,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-15 11:12:28,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-15 11:12:28,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-15 11:12:28,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-02-15 11:12:28,154 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-02-15 11:12:28,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:28,155 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-02-15 11:12:28,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-15 11:12:28,155 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-02-15 11:12:28,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-15 11:12:28,155 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:28,156 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-02-15 11:12:28,156 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:28,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:28,156 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-02-15 11:12:28,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:28,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:28,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:28,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:28,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:29,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-15 11:12:29,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:29,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:29,251 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:29,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:29,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:29,251 INFO 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-15 11:12:29,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:29,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:29,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-15 11:12:29,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:29,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:29,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-15 11:12:29,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:31,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-15 11:12:31,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:31,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-02-15 11:12:31,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:31,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-15 11:12:31,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-15 11:12:31,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-15 11:12:31,816 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-02-15 11:12:31,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:31,988 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-02-15 11:12:31,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-15 11:12:31,988 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-02-15 11:12:31,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:31,989 INFO L225 Difference]: With dead ends: 133 [2019-02-15 11:12:31,989 INFO L226 Difference]: Without dead ends: 89 [2019-02-15 11:12:31,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-15 11:12:31,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-15 11:12:31,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-15 11:12:31,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-15 11:12:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-02-15 11:12:31,993 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-02-15 11:12:31,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:31,993 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-02-15 11:12:31,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-15 11:12:31,994 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-02-15 11:12:31,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-15 11:12:31,994 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:31,994 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-02-15 11:12:31,995 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:31,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:31,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-02-15 11:12:31,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:31,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:31,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:31,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:31,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:33,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-15 11:12:33,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:33,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:33,833 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:33,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:33,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:33,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 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-15 11:12:33,843 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:33,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:33,917 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:33,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:33,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:33,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-15 11:12:33,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:36,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-15 11:12:36,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:36,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-02-15 11:12:36,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:36,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-15 11:12:36,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-15 11:12:36,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-15 11:12:36,300 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-02-15 11:12:36,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:36,472 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-02-15 11:12:36,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-15 11:12:36,472 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-02-15 11:12:36,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:36,473 INFO L225 Difference]: With dead ends: 136 [2019-02-15 11:12:36,473 INFO L226 Difference]: Without dead ends: 91 [2019-02-15 11:12:36,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-15 11:12:36,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-15 11:12:36,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-15 11:12:36,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-15 11:12:36,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-02-15 11:12:36,478 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-02-15 11:12:36,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:36,478 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-02-15 11:12:36,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-15 11:12:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-02-15 11:12:36,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-15 11:12:36,479 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:36,479 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-02-15 11:12:36,479 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:36,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:36,479 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-02-15 11:12:36,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:36,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:36,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:36,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:36,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:38,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-15 11:12:38,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:38,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:38,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:38,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:38,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:38,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 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-15 11:12:38,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:38,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:39,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-15 11:12:39,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-15 11:12:41,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:41,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-02-15 11:12:41,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:41,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-15 11:12:41,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-15 11:12:41,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-15 11:12:41,475 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-02-15 11:12:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:41,772 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-02-15 11:12:41,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-15 11:12:41,772 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-02-15 11:12:41,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:41,773 INFO L225 Difference]: With dead ends: 139 [2019-02-15 11:12:41,773 INFO L226 Difference]: Without dead ends: 93 [2019-02-15 11:12:41,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-15 11:12:41,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-15 11:12:41,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-15 11:12:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-15 11:12:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-02-15 11:12:41,778 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-02-15 11:12:41,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:41,779 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-02-15 11:12:41,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-15 11:12:41,779 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-02-15 11:12:41,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-15 11:12:41,779 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:41,779 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-02-15 11:12:41,779 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:41,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:41,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-02-15 11:12:41,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:41,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:41,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:41,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:41,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:42,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-15 11:12:42,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:42,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:42,749 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:42,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:42,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:42,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:12:42,757 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:42,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:43,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-15 11:12:43,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:43,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-15 11:12:43,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-15 11:12:45,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:45,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-02-15 11:12:45,229 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:45,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-15 11:12:45,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-15 11:12:45,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-15 11:12:45,231 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-02-15 11:12:47,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:47,098 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-02-15 11:12:47,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-15 11:12:47,098 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-02-15 11:12:47,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:47,099 INFO L225 Difference]: With dead ends: 142 [2019-02-15 11:12:47,099 INFO L226 Difference]: Without dead ends: 95 [2019-02-15 11:12:47,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-15 11:12:47,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-15 11:12:47,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-15 11:12:47,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-15 11:12:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-02-15 11:12:47,104 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-02-15 11:12:47,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:47,104 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-02-15 11:12:47,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-15 11:12:47,104 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-02-15 11:12:47,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-15 11:12:47,105 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:47,105 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-02-15 11:12:47,105 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:47,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:47,105 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-02-15 11:12:47,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:47,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:47,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:47,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:47,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-15 11:12:48,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:48,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:48,638 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:48,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:48,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:48,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:12:48,648 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:48,649 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:48,715 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:48,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:48,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:48,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-15 11:12:48,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:51,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-15 11:12:51,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:51,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-02-15 11:12:51,410 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:51,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-15 11:12:51,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-15 11:12:51,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-15 11:12:51,412 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-02-15 11:12:51,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:51,630 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-02-15 11:12:51,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-15 11:12:51,637 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-02-15 11:12:51,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:51,638 INFO L225 Difference]: With dead ends: 145 [2019-02-15 11:12:51,638 INFO L226 Difference]: Without dead ends: 97 [2019-02-15 11:12:51,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-15 11:12:51,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-15 11:12:51,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-15 11:12:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-15 11:12:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-02-15 11:12:51,642 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-02-15 11:12:51,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:51,642 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-02-15 11:12:51,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-15 11:12:51,642 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-02-15 11:12:51,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-15 11:12:51,643 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:51,643 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-02-15 11:12:51,643 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:51,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:51,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-02-15 11:12:51,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:51,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:51,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:51,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:51,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:52,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-15 11:12:52,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:52,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:52,699 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:52,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:52,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:52,700 INFO 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-15 11:12:52,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:52,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:52,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-15 11:12:52,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-15 11:12:55,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:55,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-02-15 11:12:55,156 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:55,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-15 11:12:55,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-15 11:12:55,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-15 11:12:55,157 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-02-15 11:12:55,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:55,331 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-02-15 11:12:55,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-15 11:12:55,332 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-02-15 11:12:55,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:55,333 INFO L225 Difference]: With dead ends: 148 [2019-02-15 11:12:55,333 INFO L226 Difference]: Without dead ends: 99 [2019-02-15 11:12:55,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-15 11:12:55,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-15 11:12:55,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-15 11:12:55,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-15 11:12:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-02-15 11:12:55,336 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-02-15 11:12:55,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:55,336 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-02-15 11:12:55,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-15 11:12:55,336 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-02-15 11:12:55,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-15 11:12:55,336 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:55,336 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-02-15 11:12:55,337 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:55,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:55,337 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-02-15 11:12:55,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:55,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:55,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:55,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:55,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-15 11:12:56,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:56,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:56,754 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:56,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:56,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:56,754 INFO 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-15 11:12:56,763 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:56,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:57,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-15 11:12:57,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:57,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:57,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-15 11:12:57,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-15 11:13:00,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:00,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-02-15 11:13:00,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:00,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-15 11:13:00,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-15 11:13:00,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-15 11:13:00,330 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-02-15 11:13:00,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:00,516 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-02-15 11:13:00,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-15 11:13:00,516 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-02-15 11:13:00,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:00,517 INFO L225 Difference]: With dead ends: 151 [2019-02-15 11:13:00,517 INFO L226 Difference]: Without dead ends: 101 [2019-02-15 11:13:00,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-15 11:13:00,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-15 11:13:00,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-02-15 11:13:00,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-15 11:13:00,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-02-15 11:13:00,521 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-02-15 11:13:00,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:00,521 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-02-15 11:13:00,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-15 11:13:00,521 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-02-15 11:13:00,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-15 11:13:00,522 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:00,522 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-02-15 11:13:00,522 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:00,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:00,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-02-15 11:13:00,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:00,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:00,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:00,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:00,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:01,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-15 11:13:01,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:01,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:01,734 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:01,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:01,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:01,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:13:01,742 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:13:01,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:13:01,817 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:13:01,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:01,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:01,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-15 11:13:01,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-15 11:13:04,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:04,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-02-15 11:13:04,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:04,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-15 11:13:04,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-15 11:13:04,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-15 11:13:04,337 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-02-15 11:13:04,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:04,595 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-02-15 11:13:04,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-15 11:13:04,595 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-02-15 11:13:04,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:04,596 INFO L225 Difference]: With dead ends: 154 [2019-02-15 11:13:04,596 INFO L226 Difference]: Without dead ends: 103 [2019-02-15 11:13:04,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-15 11:13:04,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-15 11:13:04,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-02-15 11:13:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-15 11:13:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-02-15 11:13:04,601 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-02-15 11:13:04,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:04,601 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-02-15 11:13:04,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-15 11:13:04,601 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-02-15 11:13:04,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-15 11:13:04,602 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:04,602 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-02-15 11:13:04,602 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:04,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:04,602 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-02-15 11:13:04,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:04,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:04,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:04,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:04,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:05,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-15 11:13:05,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:05,737 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:05,737 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:05,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:05,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:05,738 INFO 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-15 11:13:05,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:05,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:13:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:05,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:05,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-15 11:13:05,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-15 11:13:08,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:08,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-02-15 11:13:08,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:08,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-15 11:13:08,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-15 11:13:08,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-15 11:13:08,595 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-02-15 11:13:08,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:08,833 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-02-15 11:13:08,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-15 11:13:08,834 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-02-15 11:13:08,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:08,834 INFO L225 Difference]: With dead ends: 157 [2019-02-15 11:13:08,834 INFO L226 Difference]: Without dead ends: 105 [2019-02-15 11:13:08,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-15 11:13:08,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-15 11:13:08,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-02-15 11:13:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-15 11:13:08,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-02-15 11:13:08,839 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-02-15 11:13:08,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:08,839 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-02-15 11:13:08,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-15 11:13:08,839 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-02-15 11:13:08,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-15 11:13:08,840 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:08,840 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-02-15 11:13:08,840 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:08,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:08,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-02-15 11:13:08,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:08,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:08,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:08,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:08,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-15 11:13:10,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:10,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:10,208 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:10,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:10,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:10,208 INFO 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-15 11:13:10,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:13:10,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:13:11,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-15 11:13:11,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:11,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:11,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-15 11:13:11,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:14,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-15 11:13:14,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:14,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-02-15 11:13:14,231 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:14,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-15 11:13:14,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-15 11:13:14,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-15 11:13:14,232 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-02-15 11:13:14,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:14,998 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-02-15 11:13:14,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-15 11:13:14,998 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-02-15 11:13:14,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:14,999 INFO L225 Difference]: With dead ends: 160 [2019-02-15 11:13:14,999 INFO L226 Difference]: Without dead ends: 107 [2019-02-15 11:13:15,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-15 11:13:15,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-15 11:13:15,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-02-15 11:13:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-15 11:13:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-02-15 11:13:15,003 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-02-15 11:13:15,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:15,003 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-02-15 11:13:15,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-15 11:13:15,004 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-02-15 11:13:15,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-15 11:13:15,004 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:15,004 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-02-15 11:13:15,004 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:15,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:15,005 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-02-15 11:13:15,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:15,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:15,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:15,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:15,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:16,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-15 11:13:16,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:16,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:16,105 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:16,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:16,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:16,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:13:16,114 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:13:16,114 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:13:16,187 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:13:16,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:16,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:16,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-15 11:13:16,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:19,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-15 11:13:19,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:19,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-02-15 11:13:19,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:19,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-15 11:13:19,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-15 11:13:19,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-15 11:13:19,152 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-02-15 11:13:19,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:19,382 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-02-15 11:13:19,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-15 11:13:19,383 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-02-15 11:13:19,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:19,383 INFO L225 Difference]: With dead ends: 163 [2019-02-15 11:13:19,384 INFO L226 Difference]: Without dead ends: 109 [2019-02-15 11:13:19,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-15 11:13:19,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-15 11:13:19,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-02-15 11:13:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-15 11:13:19,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-02-15 11:13:19,389 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-02-15 11:13:19,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:19,389 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-02-15 11:13:19,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-15 11:13:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-02-15 11:13:19,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-15 11:13:19,390 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:19,390 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-02-15 11:13:19,390 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:19,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:19,391 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-02-15 11:13:19,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:19,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:19,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:19,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:19,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:20,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-15 11:13:20,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:20,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:20,855 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:20,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:20,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:20,855 INFO 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-15 11:13:20,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:20,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:13:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:20,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:20,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-15 11:13:20,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:24,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-15 11:13:24,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:24,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-02-15 11:13:24,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:24,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-15 11:13:24,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-15 11:13:24,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-15 11:13:24,151 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-02-15 11:13:24,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:24,386 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-02-15 11:13:24,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-15 11:13:24,387 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-02-15 11:13:24,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:24,388 INFO L225 Difference]: With dead ends: 166 [2019-02-15 11:13:24,388 INFO L226 Difference]: Without dead ends: 111 [2019-02-15 11:13:24,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-15 11:13:24,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-15 11:13:24,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-02-15 11:13:24,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-15 11:13:24,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-02-15 11:13:24,391 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-02-15 11:13:24,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:24,392 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-02-15 11:13:24,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-15 11:13:24,392 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-02-15 11:13:24,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-15 11:13:24,392 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:24,392 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-02-15 11:13:24,392 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:24,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:24,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-02-15 11:13:24,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:24,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:24,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:24,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:24,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:25,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-15 11:13:25,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:25,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:25,579 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:25,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:25,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:25,579 INFO 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-15 11:13:25,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:13:25,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:13:26,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-02-15 11:13:26,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:26,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:26,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-15 11:13:26,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:29,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-15 11:13:29,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:29,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-02-15 11:13:29,750 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:29,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-15 11:13:29,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-15 11:13:29,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-15 11:13:29,752 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2019-02-15 11:13:30,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:30,057 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2019-02-15 11:13:30,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-15 11:13:30,057 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-02-15 11:13:30,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:30,058 INFO L225 Difference]: With dead ends: 169 [2019-02-15 11:13:30,058 INFO L226 Difference]: Without dead ends: 113 [2019-02-15 11:13:30,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-15 11:13:30,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-15 11:13:30,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-02-15 11:13:30,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-15 11:13:30,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-02-15 11:13:30,062 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2019-02-15 11:13:30,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:30,062 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-02-15 11:13:30,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-15 11:13:30,062 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-02-15 11:13:30,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-02-15 11:13:30,063 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:30,063 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2019-02-15 11:13:30,063 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:30,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:30,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2019-02-15 11:13:30,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:30,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:30,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:30,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:30,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-02-15 11:13:31,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:31,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:31,461 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:31,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:31,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:31,462 INFO 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-15 11:13:31,471 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:13:31,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:13:31,550 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:13:31,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:31,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:31,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-02-15 11:13:31,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-02-15 11:13:34,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:34,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-02-15 11:13:34,868 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:34,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-15 11:13:34,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-15 11:13:34,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-15 11:13:34,870 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2019-02-15 11:13:35,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:35,103 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2019-02-15 11:13:35,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-15 11:13:35,104 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-02-15 11:13:35,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:35,105 INFO L225 Difference]: With dead ends: 172 [2019-02-15 11:13:35,105 INFO L226 Difference]: Without dead ends: 115 [2019-02-15 11:13:35,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-15 11:13:35,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-15 11:13:35,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-02-15 11:13:35,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-15 11:13:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-02-15 11:13:35,109 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2019-02-15 11:13:35,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:35,109 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-02-15 11:13:35,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-15 11:13:35,109 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-02-15 11:13:35,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-15 11:13:35,110 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:35,110 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2019-02-15 11:13:35,110 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:35,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:35,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2019-02-15 11:13:35,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:35,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:35,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:35,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:35,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:36,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-02-15 11:13:36,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:36,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:36,308 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:36,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:36,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:36,308 INFO 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-15 11:13:36,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:36,317 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:13:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:36,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:36,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-02-15 11:13:36,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-02-15 11:13:40,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:40,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-02-15 11:13:40,154 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:40,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-15 11:13:40,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-15 11:13:40,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-15 11:13:40,155 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2019-02-15 11:13:40,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:40,545 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2019-02-15 11:13:40,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-15 11:13:40,545 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2019-02-15 11:13:40,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:40,546 INFO L225 Difference]: With dead ends: 175 [2019-02-15 11:13:40,546 INFO L226 Difference]: Without dead ends: 117 [2019-02-15 11:13:40,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-15 11:13:40,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-15 11:13:40,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-02-15 11:13:40,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-15 11:13:40,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-02-15 11:13:40,549 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-02-15 11:13:40,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:40,550 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-02-15 11:13:40,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-15 11:13:40,550 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-02-15 11:13:40,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-02-15 11:13:40,550 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:40,551 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2019-02-15 11:13:40,551 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:40,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:40,551 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2019-02-15 11:13:40,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:40,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:40,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:40,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:40,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:41,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-02-15 11:13:41,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:41,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:41,771 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:41,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:41,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:41,772 INFO 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-15 11:13:41,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:13:41,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:13:42,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-15 11:13:42,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:42,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-02-15 11:13:42,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:46,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-02-15 11:13:46,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:46,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-02-15 11:13:46,224 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:46,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-15 11:13:46,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-15 11:13:46,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-15 11:13:46,226 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2019-02-15 11:13:46,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:46,568 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2019-02-15 11:13:46,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-15 11:13:46,569 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2019-02-15 11:13:46,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:46,569 INFO L225 Difference]: With dead ends: 178 [2019-02-15 11:13:46,570 INFO L226 Difference]: Without dead ends: 119 [2019-02-15 11:13:46,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-15 11:13:46,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-15 11:13:46,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-02-15 11:13:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-02-15 11:13:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-02-15 11:13:46,573 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2019-02-15 11:13:46,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:46,574 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-02-15 11:13:46,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-15 11:13:46,574 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-02-15 11:13:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-02-15 11:13:46,575 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:46,575 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2019-02-15 11:13:46,575 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:46,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:46,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2019-02-15 11:13:46,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:46,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:46,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:46,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:46,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-02-15 11:13:48,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:48,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:48,160 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:48,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:48,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:48,160 INFO 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-15 11:13:48,168 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:13:48,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:13:48,247 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:13:48,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:48,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-02-15 11:13:48,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-02-15 11:13:51,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:51,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-02-15 11:13:51,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:51,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-15 11:13:51,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-15 11:13:51,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-15 11:13:51,834 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2019-02-15 11:13:52,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:52,188 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2019-02-15 11:13:52,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-15 11:13:52,189 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2019-02-15 11:13:52,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:52,189 INFO L225 Difference]: With dead ends: 181 [2019-02-15 11:13:52,190 INFO L226 Difference]: Without dead ends: 121 [2019-02-15 11:13:52,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-15 11:13:52,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-02-15 11:13:52,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-02-15 11:13:52,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-15 11:13:52,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-02-15 11:13:52,193 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2019-02-15 11:13:52,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:52,193 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-02-15 11:13:52,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-15 11:13:52,194 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-02-15 11:13:52,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-02-15 11:13:52,194 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:52,194 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2019-02-15 11:13:52,195 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:52,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:52,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2019-02-15 11:13:52,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:52,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:52,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:52,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:52,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:53,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-02-15 11:13:53,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:53,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:53,508 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:53,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:53,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:53,508 INFO 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-15 11:13:53,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:53,519 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:13:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:53,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:53,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-02-15 11:13:53,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:57,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-02-15 11:13:57,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:57,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-02-15 11:13:57,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:57,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-02-15 11:13:57,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-02-15 11:13:57,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-15 11:13:57,182 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2019-02-15 11:13:57,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:57,624 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2019-02-15 11:13:57,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-15 11:13:57,624 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-02-15 11:13:57,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:57,625 INFO L225 Difference]: With dead ends: 184 [2019-02-15 11:13:57,625 INFO L226 Difference]: Without dead ends: 123 [2019-02-15 11:13:57,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-15 11:13:57,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-15 11:13:57,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-02-15 11:13:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-02-15 11:13:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-02-15 11:13:57,629 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-02-15 11:13:57,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:57,629 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-02-15 11:13:57,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-02-15 11:13:57,629 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-02-15 11:13:57,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-02-15 11:13:57,630 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:57,630 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2019-02-15 11:13:57,630 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:57,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:57,631 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2019-02-15 11:13:57,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:57,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:57,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:57,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:57,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:59,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-02-15 11:13:59,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:59,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:59,168 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:59,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:59,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:59,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:13:59,178 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:13:59,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:14:00,182 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-02-15 11:14:00,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:14:00,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:00,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-02-15 11:14:00,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:04,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-02-15 11:14:04,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:04,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-02-15 11:14:04,102 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:04,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-15 11:14:04,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-15 11:14:04,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-15 11:14:04,104 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2019-02-15 11:14:04,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:04,442 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2019-02-15 11:14:04,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-15 11:14:04,442 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2019-02-15 11:14:04,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:04,443 INFO L225 Difference]: With dead ends: 187 [2019-02-15 11:14:04,443 INFO L226 Difference]: Without dead ends: 125 [2019-02-15 11:14:04,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-15 11:14:04,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-02-15 11:14:04,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-02-15 11:14:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-02-15 11:14:04,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-02-15 11:14:04,446 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2019-02-15 11:14:04,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:04,446 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-02-15 11:14:04,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-15 11:14:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-02-15 11:14:04,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-02-15 11:14:04,447 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:04,447 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2019-02-15 11:14:04,447 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:04,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:04,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2019-02-15 11:14:04,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:04,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:04,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:14:04,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:04,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-02-15 11:14:05,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:05,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:05,815 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:05,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:05,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:05,816 INFO 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-15 11:14:05,825 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:14:05,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:14:05,909 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:14:05,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:14:05,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-02-15 11:14:05,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:10,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-02-15 11:14:10,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:10,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-02-15 11:14:10,070 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:10,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-02-15 11:14:10,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-02-15 11:14:10,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-15 11:14:10,072 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2019-02-15 11:14:10,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:10,349 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2019-02-15 11:14:10,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-15 11:14:10,349 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2019-02-15 11:14:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:10,350 INFO L225 Difference]: With dead ends: 190 [2019-02-15 11:14:10,350 INFO L226 Difference]: Without dead ends: 127 [2019-02-15 11:14:10,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-15 11:14:10,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-15 11:14:10,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-02-15 11:14:10,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-02-15 11:14:10,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-02-15 11:14:10,354 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2019-02-15 11:14:10,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:10,354 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-02-15 11:14:10,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-02-15 11:14:10,354 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-02-15 11:14:10,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-02-15 11:14:10,355 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:10,355 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2019-02-15 11:14:10,355 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:10,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:10,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2019-02-15 11:14:10,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:10,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:10,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:14:10,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:10,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:11,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-02-15 11:14:11,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:11,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:11,773 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:11,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:11,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:11,773 INFO 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-15 11:14:11,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:14:11,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:14:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:11,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:11,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-02-15 11:14:11,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:15,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-02-15 11:14:15,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:15,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-02-15 11:14:15,917 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:15,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-15 11:14:15,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-15 11:14:15,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-15 11:14:15,918 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2019-02-15 11:14:16,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:16,299 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2019-02-15 11:14:16,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-15 11:14:16,300 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2019-02-15 11:14:16,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:16,300 INFO L225 Difference]: With dead ends: 193 [2019-02-15 11:14:16,300 INFO L226 Difference]: Without dead ends: 129 [2019-02-15 11:14:16,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-15 11:14:16,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-02-15 11:14:16,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-02-15 11:14:16,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-02-15 11:14:16,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-02-15 11:14:16,304 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-02-15 11:14:16,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:16,304 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-02-15 11:14:16,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-15 11:14:16,304 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-02-15 11:14:16,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-02-15 11:14:16,305 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:16,305 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2019-02-15 11:14:16,305 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:16,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:16,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2019-02-15 11:14:16,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:16,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:16,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:14:16,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:16,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-02-15 11:14:17,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:17,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:17,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:17,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:17,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:17,889 INFO 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-15 11:14:17,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:14:17,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:14:18,901 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-15 11:14:18,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:14:18,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-02-15 11:14:18,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-02-15 11:14:23,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:23,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-02-15 11:14:23,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:23,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-15 11:14:23,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-15 11:14:23,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-15 11:14:23,230 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2019-02-15 11:14:23,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:23,635 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2019-02-15 11:14:23,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-15 11:14:23,636 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-02-15 11:14:23,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:23,636 INFO L225 Difference]: With dead ends: 196 [2019-02-15 11:14:23,637 INFO L226 Difference]: Without dead ends: 131 [2019-02-15 11:14:23,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-15 11:14:23,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-02-15 11:14:23,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-02-15 11:14:23,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-02-15 11:14:23,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-02-15 11:14:23,640 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2019-02-15 11:14:23,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:23,640 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-02-15 11:14:23,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-15 11:14:23,640 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-02-15 11:14:23,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-02-15 11:14:23,641 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:23,641 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2019-02-15 11:14:23,641 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:23,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:23,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2019-02-15 11:14:23,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:23,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:23,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:14:23,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:23,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-02-15 11:14:25,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:25,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:25,202 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:25,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:25,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:25,202 INFO 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-15 11:14:25,215 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:14:25,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:14:25,307 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:14:25,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:14:25,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:25,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-02-15 11:14:25,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:29,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-02-15 11:14:29,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:29,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-02-15 11:14:29,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:29,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-15 11:14:29,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-15 11:14:29,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-15 11:14:29,615 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2019-02-15 11:14:30,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:30,026 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2019-02-15 11:14:30,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-15 11:14:30,026 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2019-02-15 11:14:30,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:30,027 INFO L225 Difference]: With dead ends: 199 [2019-02-15 11:14:30,027 INFO L226 Difference]: Without dead ends: 133 [2019-02-15 11:14:30,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-15 11:14:30,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-02-15 11:14:30,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-02-15 11:14:30,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-15 11:14:30,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-02-15 11:14:30,032 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2019-02-15 11:14:30,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:30,032 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-02-15 11:14:30,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-15 11:14:30,032 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-02-15 11:14:30,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-15 11:14:30,033 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:30,033 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2019-02-15 11:14:30,033 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:30,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:30,033 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2019-02-15 11:14:30,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:30,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:30,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:14:30,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:30,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:31,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-02-15 11:14:31,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:31,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:31,556 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:31,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:31,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:31,556 INFO 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-15 11:14:31,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:14:31,566 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:14:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:31,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:31,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-02-15 11:14:31,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:37,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-02-15 11:14:37,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:37,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-02-15 11:14:37,243 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:37,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-02-15 11:14:37,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-02-15 11:14:37,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-15 11:14:37,245 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2019-02-15 11:14:37,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:37,696 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2019-02-15 11:14:37,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-15 11:14:37,696 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2019-02-15 11:14:37,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:37,696 INFO L225 Difference]: With dead ends: 202 [2019-02-15 11:14:37,697 INFO L226 Difference]: Without dead ends: 135 [2019-02-15 11:14:37,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-15 11:14:37,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-15 11:14:37,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-02-15 11:14:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-02-15 11:14:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-02-15 11:14:37,700 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-02-15 11:14:37,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:37,700 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-02-15 11:14:37,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-02-15 11:14:37,701 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-02-15 11:14:37,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-02-15 11:14:37,701 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:37,701 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2019-02-15 11:14:37,701 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:37,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:37,702 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2019-02-15 11:14:37,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:37,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:37,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:14:37,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:37,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:39,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-02-15 11:14:39,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:39,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:39,581 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:39,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:39,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:39,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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:14:39,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:14:39,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:14:42,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-15 11:14:42,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:14:42,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-02-15 11:14:42,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:48,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-02-15 11:14:48,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:48,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-02-15 11:14:48,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:48,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-15 11:14:48,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-15 11:14:48,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-15 11:14:48,269 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2019-02-15 11:14:48,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:48,701 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2019-02-15 11:14:48,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-15 11:14:48,701 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2019-02-15 11:14:48,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:48,702 INFO L225 Difference]: With dead ends: 205 [2019-02-15 11:14:48,702 INFO L226 Difference]: Without dead ends: 137 [2019-02-15 11:14:48,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-15 11:14:48,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-02-15 11:14:48,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-02-15 11:14:48,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-15 11:14:48,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-02-15 11:14:48,705 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2019-02-15 11:14:48,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:48,706 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-02-15 11:14:48,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-15 11:14:48,707 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-02-15 11:14:48,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-02-15 11:14:48,707 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:48,708 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2019-02-15 11:14:48,708 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:48,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:48,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2019-02-15 11:14:48,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:48,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:48,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:14:48,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:48,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:50,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-02-15 11:14:50,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:50,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:50,354 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:50,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:50,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:50,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:14:50,364 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:14:50,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:14:50,455 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:14:50,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:14:50,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-02-15 11:14:50,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:55,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-02-15 11:14:55,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:55,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-02-15 11:14:55,341 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:55,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-02-15 11:14:55,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-02-15 11:14:55,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-15 11:14:55,342 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2019-02-15 11:14:55,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:55,835 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2019-02-15 11:14:55,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-15 11:14:55,835 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-02-15 11:14:55,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:55,836 INFO L225 Difference]: With dead ends: 208 [2019-02-15 11:14:55,836 INFO L226 Difference]: Without dead ends: 139 [2019-02-15 11:14:55,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-15 11:14:55,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-02-15 11:14:55,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-02-15 11:14:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-02-15 11:14:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-02-15 11:14:55,839 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2019-02-15 11:14:55,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:55,839 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-02-15 11:14:55,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-02-15 11:14:55,839 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-02-15 11:14:55,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-02-15 11:14:55,840 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:55,840 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2019-02-15 11:14:55,840 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:55,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:55,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2019-02-15 11:14:55,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:55,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:55,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:14:55,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:55,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-02-15 11:14:57,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:57,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:57,544 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:57,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:57,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:57,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:14:57,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:14:57,553 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:14:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:57,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-02-15 11:14:57,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:02,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-02-15 11:15:02,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:02,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-02-15 11:15:02,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:02,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-15 11:15:02,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-15 11:15:02,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-15 11:15:02,595 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2019-02-15 11:15:03,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:03,110 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2019-02-15 11:15:03,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-15 11:15:03,110 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2019-02-15 11:15:03,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:03,111 INFO L225 Difference]: With dead ends: 211 [2019-02-15 11:15:03,111 INFO L226 Difference]: Without dead ends: 141 [2019-02-15 11:15:03,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-15 11:15:03,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-02-15 11:15:03,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-02-15 11:15:03,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-02-15 11:15:03,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-02-15 11:15:03,114 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-02-15 11:15:03,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:03,114 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-02-15 11:15:03,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-15 11:15:03,115 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-02-15 11:15:03,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-02-15 11:15:03,115 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:03,115 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2019-02-15 11:15:03,115 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:03,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:03,116 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2019-02-15 11:15:03,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:03,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:03,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:15:03,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:03,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-02-15 11:15:05,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:05,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:05,212 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:05,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:05,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:05,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:15:05,220 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:15:05,220 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:15:08,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-02-15 11:15:08,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:15:08,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:08,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-02-15 11:15:08,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:13,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-02-15 11:15:13,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:13,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-02-15 11:15:13,684 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:13,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-15 11:15:13,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-15 11:15:13,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-15 11:15:13,686 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2019-02-15 11:15:14,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:14,237 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2019-02-15 11:15:14,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-15 11:15:14,237 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2019-02-15 11:15:14,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:14,238 INFO L225 Difference]: With dead ends: 214 [2019-02-15 11:15:14,238 INFO L226 Difference]: Without dead ends: 143 [2019-02-15 11:15:14,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-15 11:15:14,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-02-15 11:15:14,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-02-15 11:15:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-02-15 11:15:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-02-15 11:15:14,242 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2019-02-15 11:15:14,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:14,242 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-02-15 11:15:14,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-15 11:15:14,242 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-02-15 11:15:14,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-02-15 11:15:14,243 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:14,243 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2019-02-15 11:15:14,243 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:14,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:14,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2019-02-15 11:15:14,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:14,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:14,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:15:14,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:14,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-02-15 11:15:16,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:16,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:16,052 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:16,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:16,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:16,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:15:16,060 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:15:16,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:15:16,156 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:15:16,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:15:16,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-02-15 11:15:16,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:21,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-02-15 11:15:21,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:21,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-02-15 11:15:21,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:21,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-15 11:15:21,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-15 11:15:21,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-15 11:15:21,517 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2019-02-15 11:15:22,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:22,080 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2019-02-15 11:15:22,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-15 11:15:22,080 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2019-02-15 11:15:22,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:22,081 INFO L225 Difference]: With dead ends: 217 [2019-02-15 11:15:22,081 INFO L226 Difference]: Without dead ends: 145 [2019-02-15 11:15:22,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-15 11:15:22,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-02-15 11:15:22,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-02-15 11:15:22,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-02-15 11:15:22,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-02-15 11:15:22,085 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2019-02-15 11:15:22,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:22,085 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-02-15 11:15:22,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-15 11:15:22,085 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-02-15 11:15:22,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-02-15 11:15:22,086 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:22,086 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2019-02-15 11:15:22,086 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:22,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:22,086 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2019-02-15 11:15:22,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:22,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:22,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:15:22,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:22,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-02-15 11:15:23,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:23,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:23,867 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:23,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:23,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:23,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:15:23,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:15:23,876 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:15:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:23,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-02-15 11:15:23,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-02-15 11:15:29,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:29,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-02-15 11:15:29,627 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:29,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-02-15 11:15:29,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-02-15 11:15:29,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-15 11:15:29,629 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2019-02-15 11:15:30,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:30,062 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2019-02-15 11:15:30,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-15 11:15:30,062 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-02-15 11:15:30,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:30,063 INFO L225 Difference]: With dead ends: 220 [2019-02-15 11:15:30,063 INFO L226 Difference]: Without dead ends: 147 [2019-02-15 11:15:30,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-15 11:15:30,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-02-15 11:15:30,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-02-15 11:15:30,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-02-15 11:15:30,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-02-15 11:15:30,067 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-02-15 11:15:30,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:30,068 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-02-15 11:15:30,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-02-15 11:15:30,068 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-02-15 11:15:30,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-02-15 11:15:30,069 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:30,069 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2019-02-15 11:15:30,069 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:30,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:30,069 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2019-02-15 11:15:30,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:30,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:30,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:15:30,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:30,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-02-15 11:15:31,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:31,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:31,918 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:31,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:31,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:31,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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:15:31,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:15:31,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:15:34,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-02-15 11:15:34,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:15:34,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:34,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-02-15 11:15:34,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:40,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-02-15 11:15:40,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:40,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-02-15 11:15:40,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:40,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-15 11:15:40,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-15 11:15:40,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-15 11:15:40,203 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2019-02-15 11:15:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:40,790 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2019-02-15 11:15:40,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-15 11:15:40,790 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2019-02-15 11:15:40,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:40,791 INFO L225 Difference]: With dead ends: 223 [2019-02-15 11:15:40,791 INFO L226 Difference]: Without dead ends: 149 [2019-02-15 11:15:40,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-15 11:15:40,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-02-15 11:15:40,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-02-15 11:15:40,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-02-15 11:15:40,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-02-15 11:15:40,795 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2019-02-15 11:15:40,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:40,796 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-02-15 11:15:40,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-15 11:15:40,796 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-02-15 11:15:40,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-02-15 11:15:40,797 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:40,797 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2019-02-15 11:15:40,797 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:40,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:40,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2019-02-15 11:15:40,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:40,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:40,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:15:40,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:40,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:42,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-02-15 11:15:42,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:42,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:42,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:42,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:42,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:42,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:15:42,805 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:15:42,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:15:42,908 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:15:42,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:15:42,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-02-15 11:15:42,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:48,622 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-02-15 11:15:48,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:48,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-02-15 11:15:48,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:48,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-15 11:15:48,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-15 11:15:48,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-15 11:15:48,644 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2019-02-15 11:15:49,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:49,174 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2019-02-15 11:15:49,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-15 11:15:49,174 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2019-02-15 11:15:49,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:49,175 INFO L225 Difference]: With dead ends: 226 [2019-02-15 11:15:49,175 INFO L226 Difference]: Without dead ends: 151 [2019-02-15 11:15:49,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-15 11:15:49,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-02-15 11:15:49,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-02-15 11:15:49,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-02-15 11:15:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-02-15 11:15:49,179 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2019-02-15 11:15:49,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:49,179 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-02-15 11:15:49,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-15 11:15:49,179 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-02-15 11:15:49,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-02-15 11:15:49,180 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:49,180 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2019-02-15 11:15:49,180 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:49,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:49,181 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2019-02-15 11:15:49,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:49,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:49,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:15:49,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:49,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-02-15 11:15:51,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:51,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:51,366 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:51,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:51,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:51,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:15:51,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:15:51,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:15:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:51,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:51,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-02-15 11:15:51,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:57,432 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-02-15 11:15:57,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:57,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-02-15 11:15:57,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:57,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-15 11:15:57,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-15 11:15:57,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-15 11:15:57,454 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2019-02-15 11:15:57,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:57,991 INFO L93 Difference]: Finished difference Result 229 states and 232 transitions. [2019-02-15 11:15:57,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-15 11:15:57,991 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2019-02-15 11:15:57,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:57,992 INFO L225 Difference]: With dead ends: 229 [2019-02-15 11:15:57,992 INFO L226 Difference]: Without dead ends: 153 [2019-02-15 11:15:57,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-15 11:15:57,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-02-15 11:15:57,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-02-15 11:15:57,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-02-15 11:15:57,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-02-15 11:15:57,996 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-02-15 11:15:57,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:57,997 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-02-15 11:15:57,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-15 11:15:57,997 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-02-15 11:15:57,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-02-15 11:15:57,998 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:57,998 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2019-02-15 11:15:57,998 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:57,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:57,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2019-02-15 11:15:57,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:57,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:57,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:15:57,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:57,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-02-15 11:16:00,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:00,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:16:00,435 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:16:00,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:16:00,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:00,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:16:00,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:16:00,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:16:02,612 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-15 11:16:02,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:16:02,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:16:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-02-15 11:16:02,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:16:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-02-15 11:16:08,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:16:08,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-02-15 11:16:08,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:16:08,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-15 11:16:08,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-15 11:16:08,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-15 11:16:08,648 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2019-02-15 11:16:09,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:16:09,262 INFO L93 Difference]: Finished difference Result 232 states and 235 transitions. [2019-02-15 11:16:09,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-15 11:16:09,262 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2019-02-15 11:16:09,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:16:09,263 INFO L225 Difference]: With dead ends: 232 [2019-02-15 11:16:09,263 INFO L226 Difference]: Without dead ends: 155 [2019-02-15 11:16:09,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-15 11:16:09,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-02-15 11:16:09,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-02-15 11:16:09,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-02-15 11:16:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-02-15 11:16:09,267 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2019-02-15 11:16:09,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:16:09,267 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-02-15 11:16:09,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-15 11:16:09,267 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-02-15 11:16:09,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-02-15 11:16:09,267 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:16:09,268 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2019-02-15 11:16:09,268 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:16:09,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:16:09,268 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2019-02-15 11:16:09,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:16:09,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:09,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:16:09,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:09,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:16:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:11,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-02-15 11:16:11,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:11,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:16:11,751 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:16:11,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:16:11,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:11,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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:16:11,759 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:16:11,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:16:11,862 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:16:11,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:16:11,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:16:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-02-15 11:16:11,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:16:18,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-02-15 11:16:18,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:16:18,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-02-15 11:16:18,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:16:18,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-15 11:16:18,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-15 11:16:18,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-15 11:16:18,082 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2019-02-15 11:16:18,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:16:18,778 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2019-02-15 11:16:18,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-15 11:16:18,779 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2019-02-15 11:16:18,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:16:18,779 INFO L225 Difference]: With dead ends: 235 [2019-02-15 11:16:18,779 INFO L226 Difference]: Without dead ends: 157 [2019-02-15 11:16:18,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-15 11:16:18,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-02-15 11:16:18,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-02-15 11:16:18,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-15 11:16:18,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-02-15 11:16:18,783 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2019-02-15 11:16:18,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:16:18,783 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-02-15 11:16:18,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-15 11:16:18,783 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-02-15 11:16:18,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-15 11:16:18,784 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:16:18,784 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2019-02-15 11:16:18,784 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:16:18,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:16:18,784 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2019-02-15 11:16:18,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:16:18,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:18,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:16:18,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:18,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:16:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:21,291 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-02-15 11:16:21,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:21,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:16:21,291 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:16:21,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:16:21,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:21,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:16:21,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:16:21,300 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:16:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:21,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:16:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-02-15 11:16:21,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:16:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-02-15 11:16:27,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:16:27,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-02-15 11:16:27,717 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:16:27,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-02-15 11:16:27,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-02-15 11:16:27,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-15 11:16:27,719 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2019-02-15 11:16:28,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:16:28,323 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2019-02-15 11:16:28,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-15 11:16:28,324 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2019-02-15 11:16:28,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:16:28,325 INFO L225 Difference]: With dead ends: 238 [2019-02-15 11:16:28,325 INFO L226 Difference]: Without dead ends: 159 [2019-02-15 11:16:28,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-15 11:16:28,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-15 11:16:28,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-02-15 11:16:28,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-02-15 11:16:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-02-15 11:16:28,330 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-02-15 11:16:28,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:16:28,330 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-02-15 11:16:28,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-02-15 11:16:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-02-15 11:16:28,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-02-15 11:16:28,331 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:16:28,331 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2019-02-15 11:16:28,331 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:16:28,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:16:28,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2019-02-15 11:16:28,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:16:28,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:28,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:16:28,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:28,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:16:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:30,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-02-15 11:16:30,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:30,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:16:30,518 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:16:30,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:16:30,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:30,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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:16:30,527 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:16:30,527 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:16:34,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-02-15 11:16:34,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:16:34,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:16:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-02-15 11:16:34,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:16:41,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-02-15 11:16:41,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:16:41,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-02-15 11:16:41,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:16:41,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-15 11:16:41,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-15 11:16:41,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-15 11:16:41,566 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2019-02-15 11:16:42,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:16:42,285 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2019-02-15 11:16:42,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-15 11:16:42,285 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2019-02-15 11:16:42,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:16:42,286 INFO L225 Difference]: With dead ends: 241 [2019-02-15 11:16:42,286 INFO L226 Difference]: Without dead ends: 161 [2019-02-15 11:16:42,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-15 11:16:42,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-02-15 11:16:42,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-02-15 11:16:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-15 11:16:42,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-02-15 11:16:42,291 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2019-02-15 11:16:42,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:16:42,292 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-02-15 11:16:42,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-15 11:16:42,292 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-02-15 11:16:42,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-15 11:16:42,292 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:16:42,293 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2019-02-15 11:16:42,293 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:16:42,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:16:42,293 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2019-02-15 11:16:42,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:16:42,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:42,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:16:42,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:42,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:16:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-02-15 11:16:44,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:44,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:16:44,512 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:16:44,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:16:44,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:44,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:16:44,521 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:16:44,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:16:44,635 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:16:44,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:16:44,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:16:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-02-15 11:16:44,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:16:51,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-02-15 11:16:51,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:16:51,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-02-15 11:16:51,346 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:16:51,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-02-15 11:16:51,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-02-15 11:16:51,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-15 11:16:51,348 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2019-02-15 11:16:52,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:16:52,146 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2019-02-15 11:16:52,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-15 11:16:52,147 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2019-02-15 11:16:52,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:16:52,147 INFO L225 Difference]: With dead ends: 244 [2019-02-15 11:16:52,147 INFO L226 Difference]: Without dead ends: 163 [2019-02-15 11:16:52,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-15 11:16:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-02-15 11:16:52,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-02-15 11:16:52,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-02-15 11:16:52,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-02-15 11:16:52,152 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2019-02-15 11:16:52,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:16:52,153 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-02-15 11:16:52,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-02-15 11:16:52,153 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-02-15 11:16:52,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-02-15 11:16:52,154 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:16:52,154 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2019-02-15 11:16:52,154 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:16:52,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:16:52,154 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2019-02-15 11:16:52,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:16:52,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:52,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:16:52,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:52,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:16:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-02-15 11:16:54,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:54,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:16:54,427 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:16:54,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:16:54,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:54,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:16:54,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:16:54,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:16:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:54,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:16:54,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-02-15 11:16:54,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:01,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-02-15 11:17:01,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:01,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-02-15 11:17:01,476 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:01,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-15 11:17:01,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-15 11:17:01,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-15 11:17:01,478 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2019-02-15 11:17:02,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:17:02,361 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2019-02-15 11:17:02,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-15 11:17:02,361 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2019-02-15 11:17:02,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:17:02,362 INFO L225 Difference]: With dead ends: 247 [2019-02-15 11:17:02,362 INFO L226 Difference]: Without dead ends: 165 [2019-02-15 11:17:02,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-15 11:17:02,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-02-15 11:17:02,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-02-15 11:17:02,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-02-15 11:17:02,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-02-15 11:17:02,366 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-02-15 11:17:02,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:17:02,367 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-02-15 11:17:02,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-15 11:17:02,367 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-02-15 11:17:02,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-02-15 11:17:02,368 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:17:02,368 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2019-02-15 11:17:02,368 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:17:02,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:17:02,368 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2019-02-15 11:17:02,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:17:02,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:02,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:17:02,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:02,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:17:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:04,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-02-15 11:17:04,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:04,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:17:04,856 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:17:04,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:17:04,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:04,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:17:04,864 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:17:04,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:17:07,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-02-15 11:17:07,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:17:07,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:17:07,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-02-15 11:17:07,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:14,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-02-15 11:17:14,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:14,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-02-15 11:17:14,789 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:14,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-15 11:17:14,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-15 11:17:14,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-15 11:17:14,791 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2019-02-15 11:17:15,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:17:15,591 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2019-02-15 11:17:15,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-15 11:17:15,591 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2019-02-15 11:17:15,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:17:15,592 INFO L225 Difference]: With dead ends: 250 [2019-02-15 11:17:15,592 INFO L226 Difference]: Without dead ends: 167 [2019-02-15 11:17:15,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-15 11:17:15,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-02-15 11:17:15,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-02-15 11:17:15,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-02-15 11:17:15,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-02-15 11:17:15,597 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2019-02-15 11:17:15,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:17:15,597 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-02-15 11:17:15,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-15 11:17:15,597 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-02-15 11:17:15,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-02-15 11:17:15,598 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:17:15,598 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2019-02-15 11:17:15,598 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:17:15,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:17:15,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2019-02-15 11:17:15,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:17:15,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:15,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:17:15,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:15,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:17:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:18,257 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-02-15 11:17:18,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:18,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:17:18,258 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:17:18,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:17:18,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:18,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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:17:18,267 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:17:18,267 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:17:18,382 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:17:18,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:17:18,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:17:18,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-02-15 11:17:18,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:25,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-02-15 11:17:25,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:25,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-02-15 11:17:25,536 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:25,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-15 11:17:25,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-15 11:17:25,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-15 11:17:25,537 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2019-02-15 11:17:26,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:17:26,206 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2019-02-15 11:17:26,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-15 11:17:26,206 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2019-02-15 11:17:26,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:17:26,207 INFO L225 Difference]: With dead ends: 253 [2019-02-15 11:17:26,207 INFO L226 Difference]: Without dead ends: 169 [2019-02-15 11:17:26,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-15 11:17:26,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-02-15 11:17:26,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-02-15 11:17:26,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-02-15 11:17:26,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-02-15 11:17:26,211 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2019-02-15 11:17:26,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:17:26,212 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-02-15 11:17:26,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-15 11:17:26,212 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-02-15 11:17:26,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-02-15 11:17:26,212 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:17:26,212 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2019-02-15 11:17:26,213 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:17:26,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:17:26,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2019-02-15 11:17:26,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:17:26,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:26,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:17:26,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:26,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:17:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-02-15 11:17:28,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:28,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:17:28,999 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:17:28,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:17:28,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:29,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:17:29,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:17:29,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:17:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:29,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:17:29,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-02-15 11:17:29,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-02-15 11:17:36,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:36,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-02-15 11:17:36,356 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:36,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-02-15 11:17:36,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-02-15 11:17:36,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-15 11:17:36,358 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2019-02-15 11:17:37,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:17:37,225 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2019-02-15 11:17:37,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-15 11:17:37,226 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2019-02-15 11:17:37,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:17:37,226 INFO L225 Difference]: With dead ends: 256 [2019-02-15 11:17:37,226 INFO L226 Difference]: Without dead ends: 171 [2019-02-15 11:17:37,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-15 11:17:37,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-02-15 11:17:37,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-02-15 11:17:37,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-02-15 11:17:37,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2019-02-15 11:17:37,230 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2019-02-15 11:17:37,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:17:37,230 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2019-02-15 11:17:37,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-02-15 11:17:37,230 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2019-02-15 11:17:37,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-02-15 11:17:37,231 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:17:37,231 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2019-02-15 11:17:37,231 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:17:37,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:17:37,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2019-02-15 11:17:37,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:17:37,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:37,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:17:37,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:37,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:17:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:40,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-02-15 11:17:40,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:40,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:17:40,107 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:17:40,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:17:40,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:40,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:17:40,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:17:40,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:17:48,666 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-02-15 11:17:48,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:17:48,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:17:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-02-15 11:17:48,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-02-15 11:17:56,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:56,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-02-15 11:17:56,261 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:56,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-15 11:17:56,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-15 11:17:56,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-15 11:17:56,263 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2019-02-15 11:17:57,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:17:57,200 INFO L93 Difference]: Finished difference Result 259 states and 262 transitions. [2019-02-15 11:17:57,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-15 11:17:57,201 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2019-02-15 11:17:57,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:17:57,202 INFO L225 Difference]: With dead ends: 259 [2019-02-15 11:17:57,202 INFO L226 Difference]: Without dead ends: 173 [2019-02-15 11:17:57,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-15 11:17:57,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-15 11:17:57,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-02-15 11:17:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-02-15 11:17:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2019-02-15 11:17:57,206 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2019-02-15 11:17:57,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:17:57,206 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2019-02-15 11:17:57,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-15 11:17:57,206 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2019-02-15 11:17:57,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-02-15 11:17:57,207 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:17:57,207 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2019-02-15 11:17:57,207 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:17:57,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:17:57,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2019-02-15 11:17:57,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:17:57,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:57,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:17:57,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:57,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:17:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:00,131 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-02-15 11:18:00,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:00,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:18:00,132 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:18:00,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:18:00,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:00,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:18:00,141 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:18:00,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:18:00,258 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:18:00,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:18:00,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:18:00,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-02-15 11:18:00,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:18:07,780 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-02-15 11:18:07,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:18:07,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-02-15 11:18:07,800 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:18:07,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-02-15 11:18:07,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-02-15 11:18:07,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-15 11:18:07,802 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2019-02-15 11:18:08,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:18:08,740 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2019-02-15 11:18:08,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-15 11:18:08,740 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2019-02-15 11:18:08,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:18:08,741 INFO L225 Difference]: With dead ends: 262 [2019-02-15 11:18:08,741 INFO L226 Difference]: Without dead ends: 175 [2019-02-15 11:18:08,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-15 11:18:08,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-02-15 11:18:08,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-02-15 11:18:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-02-15 11:18:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-02-15 11:18:08,746 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2019-02-15 11:18:08,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:18:08,746 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-02-15 11:18:08,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-02-15 11:18:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-02-15 11:18:08,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-02-15 11:18:08,747 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:18:08,747 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2019-02-15 11:18:08,748 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:18:08,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:18:08,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2019-02-15 11:18:08,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:18:08,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:08,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:18:08,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:08,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:18:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-02-15 11:18:11,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:11,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:18:11,381 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:18:11,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:18:11,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:11,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:18:11,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:18:11,394 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:18:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:11,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:18:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-02-15 11:18:11,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:18:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-02-15 11:18:19,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:18:19,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-02-15 11:18:19,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:18:19,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-15 11:18:19,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-15 11:18:19,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-15 11:18:19,614 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2019-02-15 11:18:20,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:18:20,573 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2019-02-15 11:18:20,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-15 11:18:20,573 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2019-02-15 11:18:20,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:18:20,574 INFO L225 Difference]: With dead ends: 265 [2019-02-15 11:18:20,574 INFO L226 Difference]: Without dead ends: 177 [2019-02-15 11:18:20,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-15 11:18:20,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-02-15 11:18:20,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-02-15 11:18:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-02-15 11:18:20,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-02-15 11:18:20,578 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2019-02-15 11:18:20,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:18:20,579 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-02-15 11:18:20,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-15 11:18:20,579 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-02-15 11:18:20,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-02-15 11:18:20,580 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:18:20,580 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2019-02-15 11:18:20,580 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:18:20,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:18:20,581 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2019-02-15 11:18:20,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:18:20,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:20,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:18:20,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:20,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:18:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:23,323 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-02-15 11:18:23,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:23,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:18:23,323 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:18:23,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:18:23,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:23,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:18:23,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:18:23,332 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:18:32,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-02-15 11:18:32,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:18:32,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:18:32,326 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-02-15 11:18:32,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:18:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-02-15 11:18:40,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:18:40,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-02-15 11:18:40,630 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:18:40,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-15 11:18:40,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-15 11:18:40,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-15 11:18:40,632 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2019-02-15 11:18:41,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:18:41,499 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2019-02-15 11:18:41,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-15 11:18:41,500 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2019-02-15 11:18:41,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:18:41,501 INFO L225 Difference]: With dead ends: 268 [2019-02-15 11:18:41,501 INFO L226 Difference]: Without dead ends: 179 [2019-02-15 11:18:41,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-15 11:18:41,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-02-15 11:18:41,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-02-15 11:18:41,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-02-15 11:18:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-02-15 11:18:41,506 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2019-02-15 11:18:41,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:18:41,506 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-02-15 11:18:41,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-15 11:18:41,506 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-02-15 11:18:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-02-15 11:18:41,507 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:18:41,507 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2019-02-15 11:18:41,507 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:18:41,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:18:41,507 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2019-02-15 11:18:41,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:18:41,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:41,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:18:41,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:41,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:18:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:44,534 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-02-15 11:18:44,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:44,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:18:44,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:18:44,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:18:44,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:44,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:18:44,543 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:18:44,543 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:18:44,665 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:18:44,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:18:44,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:18:44,694 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-02-15 11:18:44,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:18:52,807 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-02-15 11:18:52,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:18:52,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-02-15 11:18:52,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:18:52,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-15 11:18:52,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-15 11:18:52,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-15 11:18:52,828 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2019-02-15 11:18:53,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:18:53,961 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2019-02-15 11:18:53,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-15 11:18:53,961 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2019-02-15 11:18:53,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:18:53,962 INFO L225 Difference]: With dead ends: 271 [2019-02-15 11:18:53,962 INFO L226 Difference]: Without dead ends: 181 [2019-02-15 11:18:53,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-15 11:18:53,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-02-15 11:18:53,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-02-15 11:18:53,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-15 11:18:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2019-02-15 11:18:53,966 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2019-02-15 11:18:53,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:18:53,966 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2019-02-15 11:18:53,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-15 11:18:53,966 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2019-02-15 11:18:53,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-02-15 11:18:53,967 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:18:53,967 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2019-02-15 11:18:53,967 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:18:53,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:18:53,968 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2019-02-15 11:18:53,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:18:53,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:53,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:18:53,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:53,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:18:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:57,023 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-02-15 11:18:57,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:57,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:18:57,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:18:57,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:18:57,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:57,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:18:57,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:18:57,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:18:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:57,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:18:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-02-15 11:18:57,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:19:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-02-15 11:19:05,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:19:05,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-02-15 11:19:05,737 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:19:05,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-15 11:19:05,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-15 11:19:05,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-15 11:19:05,739 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2019-02-15 11:19:06,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:19:06,625 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-02-15 11:19:06,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-15 11:19:06,626 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2019-02-15 11:19:06,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:19:06,626 INFO L225 Difference]: With dead ends: 274 [2019-02-15 11:19:06,626 INFO L226 Difference]: Without dead ends: 183 [2019-02-15 11:19:06,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-15 11:19:06,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-02-15 11:19:06,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-02-15 11:19:06,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-02-15 11:19:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-02-15 11:19:06,630 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2019-02-15 11:19:06,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:19:06,630 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-02-15 11:19:06,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-15 11:19:06,630 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-02-15 11:19:06,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-02-15 11:19:06,631 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:19:06,631 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2019-02-15 11:19:06,631 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:19:06,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:19:06,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2019-02-15 11:19:06,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:19:06,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:06,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:19:06,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:06,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:19:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:19:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-02-15 11:19:09,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:09,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:19:09,807 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:19:09,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:19:09,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:09,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:19:09,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:19:09,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:19:14,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-02-15 11:19:14,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:19:14,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:19:14,540 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-02-15 11:19:14,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:19:23,285 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-02-15 11:19:23,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:19:23,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-02-15 11:19:23,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:19:23,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-15 11:19:23,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-15 11:19:23,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-15 11:19:23,312 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2019-02-15 11:19:24,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:19:24,188 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2019-02-15 11:19:24,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-15 11:19:24,188 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2019-02-15 11:19:24,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:19:24,189 INFO L225 Difference]: With dead ends: 277 [2019-02-15 11:19:24,189 INFO L226 Difference]: Without dead ends: 185 [2019-02-15 11:19:24,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-15 11:19:24,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-02-15 11:19:24,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-02-15 11:19:24,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-15 11:19:24,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-02-15 11:19:24,194 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2019-02-15 11:19:24,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:19:24,194 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-02-15 11:19:24,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-15 11:19:24,194 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-02-15 11:19:24,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-02-15 11:19:24,195 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:19:24,195 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2019-02-15 11:19:24,195 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:19:24,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:19:24,195 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2019-02-15 11:19:24,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:19:24,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:24,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:19:24,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:24,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:19:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:19:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-02-15 11:19:27,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:27,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:19:27,447 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:19:27,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:19:27,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:27,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:19:27,456 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:19:27,456 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:19:27,581 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:19:27,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:19:27,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:19:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-02-15 11:19:27,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:19:36,554 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-02-15 11:19:36,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:19:36,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-02-15 11:19:36,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:19:36,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-02-15 11:19:36,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-02-15 11:19:36,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-15 11:19:36,576 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2019-02-15 11:19:37,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:19:37,497 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2019-02-15 11:19:37,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-15 11:19:37,497 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2019-02-15 11:19:37,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:19:37,498 INFO L225 Difference]: With dead ends: 280 [2019-02-15 11:19:37,498 INFO L226 Difference]: Without dead ends: 187 [2019-02-15 11:19:37,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-15 11:19:37,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-02-15 11:19:37,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-02-15 11:19:37,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-02-15 11:19:37,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-02-15 11:19:37,504 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2019-02-15 11:19:37,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:19:37,504 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2019-02-15 11:19:37,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-02-15 11:19:37,504 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2019-02-15 11:19:37,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-02-15 11:19:37,505 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:19:37,505 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2019-02-15 11:19:37,506 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:19:37,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:19:37,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2019-02-15 11:19:37,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:19:37,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:37,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:19:37,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:37,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:19:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:19:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-02-15 11:19:40,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:40,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:19:40,838 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:19:40,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:19:40,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:40,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:19:40,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:19:40,848 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:19:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:19:40,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:19:41,003 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-02-15 11:19:41,003 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:19:49,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-02-15 11:19:49,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:19:49,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-02-15 11:19:49,853 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:19:49,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-15 11:19:49,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-15 11:19:49,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-15 11:19:49,855 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2019-02-15 11:19:51,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:19:51,010 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2019-02-15 11:19:51,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-15 11:19:51,011 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2019-02-15 11:19:51,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:19:51,011 INFO L225 Difference]: With dead ends: 283 [2019-02-15 11:19:51,012 INFO L226 Difference]: Without dead ends: 189 [2019-02-15 11:19:51,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-15 11:19:51,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-02-15 11:19:51,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-02-15 11:19:51,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-02-15 11:19:51,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2019-02-15 11:19:51,016 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2019-02-15 11:19:51,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:19:51,016 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2019-02-15 11:19:51,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-15 11:19:51,017 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2019-02-15 11:19:51,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-02-15 11:19:51,017 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:19:51,018 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2019-02-15 11:19:51,018 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:19:51,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:19:51,018 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2019-02-15 11:19:51,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:19:51,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:51,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:19:51,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:51,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:19:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:19:54,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-02-15 11:19:54,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:54,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:19:54,041 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:19:54,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:19:54,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:54,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:19:54,049 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:19:54,049 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:19:59,034 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-02-15 11:19:59,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:19:59,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:19:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-02-15 11:19:59,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:20:08,431 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-02-15 11:20:08,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:20:08,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-02-15 11:20:08,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:20:08,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-15 11:20:08,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-15 11:20:08,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-15 11:20:08,459 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2019-02-15 11:20:09,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:20:09,513 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-02-15 11:20:09,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-15 11:20:09,513 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2019-02-15 11:20:09,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:20:09,514 INFO L225 Difference]: With dead ends: 286 [2019-02-15 11:20:09,514 INFO L226 Difference]: Without dead ends: 191 [2019-02-15 11:20:09,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-15 11:20:09,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-02-15 11:20:09,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-02-15 11:20:09,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-02-15 11:20:09,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-02-15 11:20:09,519 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2019-02-15 11:20:09,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:20:09,520 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-02-15 11:20:09,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-15 11:20:09,520 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-02-15 11:20:09,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-02-15 11:20:09,521 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:20:09,521 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2019-02-15 11:20:09,521 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:20:09,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:20:09,521 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2019-02-15 11:20:09,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:20:09,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:09,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:20:09,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:09,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:20:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:20:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-02-15 11:20:12,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:12,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:20:12,904 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:20:12,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:20:12,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:12,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:20:12,914 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:20:12,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:20:13,045 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:20:13,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:20:13,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:20:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-02-15 11:20:13,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:20:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-02-15 11:20:22,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:20:22,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-02-15 11:20:22,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:20:22,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-15 11:20:22,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-15 11:20:22,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-15 11:20:22,732 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2019-02-15 11:20:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:20:24,018 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2019-02-15 11:20:24,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-15 11:20:24,019 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2019-02-15 11:20:24,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:20:24,020 INFO L225 Difference]: With dead ends: 289 [2019-02-15 11:20:24,020 INFO L226 Difference]: Without dead ends: 193 [2019-02-15 11:20:24,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-15 11:20:24,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-02-15 11:20:24,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-02-15 11:20:24,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-02-15 11:20:24,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-02-15 11:20:24,023 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2019-02-15 11:20:24,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:20:24,023 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-02-15 11:20:24,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-15 11:20:24,024 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-02-15 11:20:24,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-02-15 11:20:24,024 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:20:24,024 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2019-02-15 11:20:24,024 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:20:24,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:20:24,025 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2019-02-15 11:20:24,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:20:24,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:24,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:20:24,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:24,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:20:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:20:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-02-15 11:20:27,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:27,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:20:27,481 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:20:27,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:20:27,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:27,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:20:27,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:20:27,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:20:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:20:27,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:20:27,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-02-15 11:20:27,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:20:37,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-02-15 11:20:37,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:20:37,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-02-15 11:20:37,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:20:37,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-02-15 11:20:37,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-02-15 11:20:37,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-15 11:20:37,366 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2019-02-15 11:20:38,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:20:38,704 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2019-02-15 11:20:38,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-15 11:20:38,705 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2019-02-15 11:20:38,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:20:38,706 INFO L225 Difference]: With dead ends: 292 [2019-02-15 11:20:38,706 INFO L226 Difference]: Without dead ends: 195 [2019-02-15 11:20:38,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-15 11:20:38,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-02-15 11:20:38,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-02-15 11:20:38,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-02-15 11:20:38,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2019-02-15 11:20:38,712 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2019-02-15 11:20:38,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:20:38,712 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2019-02-15 11:20:38,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-02-15 11:20:38,712 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2019-02-15 11:20:38,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-02-15 11:20:38,713 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:20:38,713 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2019-02-15 11:20:38,713 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:20:38,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:20:38,713 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2019-02-15 11:20:38,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:20:38,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:38,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:20:38,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:38,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:20:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:20:42,223 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-02-15 11:20:42,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:42,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:20:42,223 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:20:42,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:20:42,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:42,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:20:42,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:20:42,232 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:20:48,105 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-02-15 11:20:48,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:20:48,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:20:48,142 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-02-15 11:20:48,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:20:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-02-15 11:20:58,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:20:58,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-02-15 11:20:58,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:20:58,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-15 11:20:58,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-15 11:20:58,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-15 11:20:58,276 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2019-02-15 11:20:59,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:20:59,722 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-02-15 11:20:59,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-15 11:20:59,723 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2019-02-15 11:20:59,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:20:59,723 INFO L225 Difference]: With dead ends: 295 [2019-02-15 11:20:59,724 INFO L226 Difference]: Without dead ends: 197 [2019-02-15 11:20:59,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-15 11:20:59,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-02-15 11:20:59,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-02-15 11:20:59,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-02-15 11:20:59,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2019-02-15 11:20:59,729 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2019-02-15 11:20:59,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:20:59,730 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2019-02-15 11:20:59,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-15 11:20:59,730 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2019-02-15 11:20:59,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-02-15 11:20:59,731 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:20:59,731 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2019-02-15 11:20:59,731 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:20:59,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:20:59,731 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2019-02-15 11:20:59,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:20:59,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:59,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:20:59,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:59,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:20:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:21:03,253 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-02-15 11:21:03,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:03,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:21:03,253 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:21:03,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:21:03,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:03,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:21:03,265 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:21:03,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:21:03,398 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:21:03,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:21:03,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:21:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-02-15 11:21:03,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:21:13,571 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-02-15 11:21:13,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:21:13,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-02-15 11:21:13,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:21:13,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-02-15 11:21:13,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-02-15 11:21:13,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-15 11:21:13,592 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2019-02-15 11:21:15,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:21:15,051 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2019-02-15 11:21:15,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-15 11:21:15,051 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2019-02-15 11:21:15,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:21:15,052 INFO L225 Difference]: With dead ends: 298 [2019-02-15 11:21:15,052 INFO L226 Difference]: Without dead ends: 199 [2019-02-15 11:21:15,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-15 11:21:15,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-02-15 11:21:15,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-02-15 11:21:15,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-02-15 11:21:15,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-02-15 11:21:15,056 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2019-02-15 11:21:15,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:21:15,056 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-02-15 11:21:15,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-02-15 11:21:15,057 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-02-15 11:21:15,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-02-15 11:21:15,057 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:21:15,057 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2019-02-15 11:21:15,057 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:21:15,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:21:15,058 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2019-02-15 11:21:15,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:21:15,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:15,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:21:15,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:15,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:21:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:21:18,723 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-02-15 11:21:18,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:18,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:21:18,724 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:21:18,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:21:18,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:18,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:21:18,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:21:18,733 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:21:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:21:18,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:21:18,900 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-02-15 11:21:18,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:21:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-02-15 11:21:29,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:21:29,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-02-15 11:21:29,245 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:21:29,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-15 11:21:29,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-15 11:21:29,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-15 11:21:29,247 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2019-02-15 11:21:30,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:21:30,444 INFO L93 Difference]: Finished difference Result 301 states and 304 transitions. [2019-02-15 11:21:30,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-15 11:21:30,445 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2019-02-15 11:21:30,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:21:30,446 INFO L225 Difference]: With dead ends: 301 [2019-02-15 11:21:30,446 INFO L226 Difference]: Without dead ends: 201 [2019-02-15 11:21:30,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-15 11:21:30,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-02-15 11:21:30,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-02-15 11:21:30,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-02-15 11:21:30,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-02-15 11:21:30,450 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2019-02-15 11:21:30,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:21:30,450 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-02-15 11:21:30,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-15 11:21:30,450 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-02-15 11:21:30,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-02-15 11:21:30,451 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:21:30,451 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2019-02-15 11:21:30,451 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:21:30,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:21:30,451 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2019-02-15 11:21:30,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:21:30,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:30,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:21:30,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:30,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:21:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:21:34,209 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-02-15 11:21:34,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:34,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:21:34,209 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:21:34,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:21:34,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:34,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:21:34,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:21:34,219 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:21:48,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-02-15 11:21:48,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:21:48,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:21:48,780 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-02-15 11:21:48,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:21:59,264 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-02-15 11:21:59,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:21:59,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-02-15 11:21:59,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:21:59,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-15 11:21:59,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-15 11:21:59,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-15 11:21:59,293 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2019-02-15 11:22:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:22:00,818 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2019-02-15 11:22:00,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-15 11:22:00,819 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2019-02-15 11:22:00,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:22:00,819 INFO L225 Difference]: With dead ends: 304 [2019-02-15 11:22:00,820 INFO L226 Difference]: Without dead ends: 203 [2019-02-15 11:22:00,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-15 11:22:00,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-02-15 11:22:00,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-02-15 11:22:00,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-02-15 11:22:00,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2019-02-15 11:22:00,824 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2019-02-15 11:22:00,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:22:00,824 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2019-02-15 11:22:00,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-15 11:22:00,824 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2019-02-15 11:22:00,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-02-15 11:22:00,824 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:22:00,825 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2019-02-15 11:22:00,825 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:22:00,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:22:00,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2019-02-15 11:22:00,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:22:00,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:00,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:22:00,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:00,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:22:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:22:04,749 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-02-15 11:22:04,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:04,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:22:04,750 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:22:04,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:22:04,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:04,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:22:04,759 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:22:04,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:22:04,900 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:22:04,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:22:04,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:22:04,934 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-02-15 11:22:04,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:22:15,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-02-15 11:22:15,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:22:15,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-02-15 11:22:15,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:22:15,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-15 11:22:15,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-15 11:22:15,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-15 11:22:15,460 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2019-02-15 11:22:17,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:22:17,060 INFO L93 Difference]: Finished difference Result 307 states and 310 transitions. [2019-02-15 11:22:17,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-02-15 11:22:17,061 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2019-02-15 11:22:17,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:22:17,062 INFO L225 Difference]: With dead ends: 307 [2019-02-15 11:22:17,062 INFO L226 Difference]: Without dead ends: 205 [2019-02-15 11:22:17,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-15 11:22:17,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-02-15 11:22:17,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-02-15 11:22:17,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-02-15 11:22:17,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-02-15 11:22:17,066 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2019-02-15 11:22:17,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:22:17,066 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-02-15 11:22:17,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-15 11:22:17,066 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-02-15 11:22:17,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-02-15 11:22:17,067 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:22:17,067 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2019-02-15 11:22:17,067 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:22:17,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:22:17,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2019-02-15 11:22:17,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:22:17,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:17,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:22:17,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:17,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:22:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:22:20,881 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-02-15 11:22:20,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:20,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:22:20,881 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:22:20,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:22:20,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:20,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:22:20,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:22:20,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:22:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:22:21,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:22:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-02-15 11:22:21,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:22:32,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-02-15 11:22:32,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:22:32,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-02-15 11:22:32,066 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:22:32,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-15 11:22:32,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-15 11:22:32,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-15 11:22:32,068 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2019-02-15 11:22:33,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:22:33,609 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2019-02-15 11:22:33,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-15 11:22:33,610 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2019-02-15 11:22:33,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:22:33,611 INFO L225 Difference]: With dead ends: 310 [2019-02-15 11:22:33,611 INFO L226 Difference]: Without dead ends: 207 [2019-02-15 11:22:33,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-15 11:22:33,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-02-15 11:22:33,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-02-15 11:22:33,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-02-15 11:22:33,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-02-15 11:22:33,617 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2019-02-15 11:22:33,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:22:33,617 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-02-15 11:22:33,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-15 11:22:33,617 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-02-15 11:22:33,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-02-15 11:22:33,618 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:22:33,618 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2019-02-15 11:22:33,619 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:22:33,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:22:33,619 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2019-02-15 11:22:33,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:22:33,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:33,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:22:33,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:33,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:22:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:22:37,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-02-15 11:22:37,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:37,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:22:37,570 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:22:37,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:22:37,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:37,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:22:37,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:22:37,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:22:55,950 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-02-15 11:22:55,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:22:56,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:22:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-02-15 11:22:56,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:23:07,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-02-15 11:23:07,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:23:07,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-02-15 11:23:07,204 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:23:07,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-15 11:23:07,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-15 11:23:07,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-15 11:23:07,208 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2019-02-15 11:23:08,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:23:08,887 INFO L93 Difference]: Finished difference Result 313 states and 316 transitions. [2019-02-15 11:23:08,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-02-15 11:23:08,887 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2019-02-15 11:23:08,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:23:08,889 INFO L225 Difference]: With dead ends: 313 [2019-02-15 11:23:08,889 INFO L226 Difference]: Without dead ends: 209 [2019-02-15 11:23:08,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-15 11:23:08,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-02-15 11:23:08,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-02-15 11:23:08,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-02-15 11:23:08,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-02-15 11:23:08,894 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2019-02-15 11:23:08,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:23:08,894 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-02-15 11:23:08,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-15 11:23:08,895 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-02-15 11:23:08,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-02-15 11:23:08,896 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:23:08,896 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1] [2019-02-15 11:23:08,896 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:23:08,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:23:08,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1650876630, now seen corresponding path program 102 times [2019-02-15 11:23:08,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:23:08,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:23:08,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:23:08,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:23:08,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:23:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:23:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-02-15 11:23:12,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:23:12,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:23:12,890 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:23:12,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:23:12,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:23:12,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:23:12,898 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:23:12,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:23:13,042 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:23:13,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:23:13,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:23:13,078 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-02-15 11:23:13,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:23:24,392 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-02-15 11:23:24,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:23:24,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-02-15 11:23:24,410 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:23:24,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-15 11:23:24,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-15 11:23:24,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-15 11:23:24,413 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2019-02-15 11:23:25,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:23:25,841 INFO L93 Difference]: Finished difference Result 316 states and 319 transitions. [2019-02-15 11:23:25,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-02-15 11:23:25,841 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2019-02-15 11:23:25,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:23:25,842 INFO L225 Difference]: With dead ends: 316 [2019-02-15 11:23:25,842 INFO L226 Difference]: Without dead ends: 211 [2019-02-15 11:23:25,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-15 11:23:25,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-02-15 11:23:25,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-02-15 11:23:25,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-02-15 11:23:25,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2019-02-15 11:23:25,847 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2019-02-15 11:23:25,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:23:25,848 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2019-02-15 11:23:25,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-15 11:23:25,848 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2019-02-15 11:23:25,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-02-15 11:23:25,849 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:23:25,849 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1] [2019-02-15 11:23:25,849 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:23:25,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:23:25,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1160939221, now seen corresponding path program 103 times [2019-02-15 11:23:25,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:23:25,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:23:25,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:23:25,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:23:25,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:23:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:23:29,595 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-02-15 11:23:29,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:23:29,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:23:29,595 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:23:29,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:23:29,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:23:29,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:23:29,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:23:29,606 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:23:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:23:29,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:23:29,792 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-02-15 11:23:29,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:23:41,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-02-15 11:23:41,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:23:41,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-02-15 11:23:41,444 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:23:41,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-15 11:23:41,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-15 11:23:41,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-15 11:23:41,446 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 106 states. [2019-02-15 11:23:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:23:43,144 INFO L93 Difference]: Finished difference Result 319 states and 322 transitions. [2019-02-15 11:23:43,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-02-15 11:23:43,149 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2019-02-15 11:23:43,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:23:43,150 INFO L225 Difference]: With dead ends: 319 [2019-02-15 11:23:43,150 INFO L226 Difference]: Without dead ends: 213 [2019-02-15 11:23:43,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-15 11:23:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-02-15 11:23:43,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-02-15 11:23:43,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-15 11:23:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2019-02-15 11:23:43,156 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2019-02-15 11:23:43,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:23:43,156 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2019-02-15 11:23:43,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-15 11:23:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2019-02-15 11:23:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-02-15 11:23:43,157 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:23:43,157 INFO L402 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1] [2019-02-15 11:23:43,157 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:23:43,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:23:43,158 INFO L82 PathProgramCache]: Analyzing trace with hash 193908298, now seen corresponding path program 104 times [2019-02-15 11:23:43,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:23:43,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:23:43,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:23:43,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:23:43,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:23:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:23:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-02-15 11:23:47,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:23:47,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:23:47,381 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:23:47,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:23:47,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:23:47,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:23:47,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:23:47,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:23:55,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-02-15 11:23:55,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:23:55,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:23:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-02-15 11:23:55,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:24:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-02-15 11:24:07,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:24:07,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-02-15 11:24:07,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:24:07,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-15 11:24:07,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-15 11:24:07,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-15 11:24:07,557 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 107 states. [2019-02-15 11:24:09,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:24:09,097 INFO L93 Difference]: Finished difference Result 322 states and 325 transitions. [2019-02-15 11:24:09,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-02-15 11:24:09,098 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2019-02-15 11:24:09,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:24:09,098 INFO L225 Difference]: With dead ends: 322 [2019-02-15 11:24:09,099 INFO L226 Difference]: Without dead ends: 215 [2019-02-15 11:24:09,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-15 11:24:09,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-15 11:24:09,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-02-15 11:24:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-02-15 11:24:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2019-02-15 11:24:09,105 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 212 [2019-02-15 11:24:09,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:24:09,105 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2019-02-15 11:24:09,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-15 11:24:09,106 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2019-02-15 11:24:09,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-02-15 11:24:09,107 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:24:09,107 INFO L402 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1, 1] [2019-02-15 11:24:09,107 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:24:09,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:24:09,107 INFO L82 PathProgramCache]: Analyzing trace with hash 913063733, now seen corresponding path program 105 times [2019-02-15 11:24:09,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:24:09,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:09,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:24:09,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:09,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:24:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:13,413 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2019-02-15 11:24:13,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:13,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:24:13,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:24:13,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:24:13,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:13,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:24:13,422 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:24:13,422 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP)