java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/up.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:44:29,305 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:44:29,309 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:44:29,331 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:44:29,331 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:44:29,332 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:44:29,336 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:44:29,339 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:44:29,342 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:44:29,343 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:44:29,344 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:44:29,345 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:44:29,345 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:44:29,346 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:44:29,347 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:44:29,348 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:44:29,349 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:44:29,351 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:44:29,353 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:44:29,355 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:44:29,356 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:44:29,358 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:44:29,361 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:44:29,362 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:44:29,362 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:44:29,365 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:44:29,366 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:44:29,366 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:44:29,371 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:44:29,372 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:44:29,372 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:44:29,375 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:44:29,376 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:44:29,376 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:44:29,377 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:44:29,378 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:44:29,379 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:44:29,401 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:44:29,403 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:44:29,404 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:44:29,404 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:44:29,405 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:44:29,405 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:44:29,405 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:44:29,405 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:44:29,405 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:44:29,406 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:44:29,406 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:44:29,407 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:44:29,407 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:44:29,407 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:44:29,407 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:44:29,408 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:44:29,408 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:44:29,408 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:44:29,410 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:44:29,411 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:44:29,411 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:44:29,411 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:44:29,411 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:44:29,411 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:44:29,411 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:44:29,412 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:44:29,412 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:44:29,413 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:44:29,413 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:44:29,413 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:44:29,413 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:44:29,413 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:44:29,414 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:44:29,414 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:44:29,414 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:44:29,414 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:44:29,414 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:44:29,416 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:44:29,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:44:29,416 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:44:29,416 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:44:29,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:44:29,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:44:29,493 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:44:29,495 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:44:29,496 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:44:29,497 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/up.i_4.bpl [2018-12-03 15:44:29,497 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/up.i_4.bpl' [2018-12-03 15:44:29,544 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:44:29,545 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:44:29,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:44:29,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:44:29,546 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:44:29,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:44:29" (1/1) ... [2018-12-03 15:44:29,575 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:44:29" (1/1) ... [2018-12-03 15:44:29,587 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:44:29,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:44:29,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:44:29,589 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:44:29,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:44:29" (1/1) ... [2018-12-03 15:44:29,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:44:29" (1/1) ... [2018-12-03 15:44:29,603 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:44:29" (1/1) ... [2018-12-03 15:44:29,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:44:29" (1/1) ... [2018-12-03 15:44:29,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:44:29" (1/1) ... [2018-12-03 15:44:29,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:44:29" (1/1) ... [2018-12-03 15:44:29,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:44:29" (1/1) ... [2018-12-03 15:44:29,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:44:29,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:44:29,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:44:29,614 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:44:29,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:44:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:44:29,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:44:29,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:44:29,934 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:44:29,935 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-03 15:44:29,935 INFO L202 PluginConnector]: Adding new model up.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:44:29 BoogieIcfgContainer [2018-12-03 15:44:29,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:44:29,937 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:44:29,937 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:44:29,940 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:44:29,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:44:29" (1/2) ... [2018-12-03 15:44:29,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f623f8 and model type up.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:44:29, skipping insertion in model container [2018-12-03 15:44:29,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:44:29" (2/2) ... [2018-12-03 15:44:29,943 INFO L112 eAbstractionObserver]: Analyzing ICFG up.i_4.bpl [2018-12-03 15:44:29,953 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:44:29,961 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:44:29,975 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:44:30,007 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:44:30,008 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:44:30,008 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:44:30,008 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:44:30,008 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:44:30,008 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:44:30,009 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:44:30,009 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:44:30,024 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-12-03 15:44:30,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:44:30,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:30,032 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 15:44:30,035 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:30,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:30,041 INFO L82 PathProgramCache]: Analyzing trace with hash 28787237, now seen corresponding path program 1 times [2018-12-03 15:44:30,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:30,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:30,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:30,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:30,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:30,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:44:30,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:44:30,284 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:44:30,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:44:30,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:44:30,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:44:30,327 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2018-12-03 15:44:30,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:30,455 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-12-03 15:44:30,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:44:30,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-03 15:44:30,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:30,468 INFO L225 Difference]: With dead ends: 14 [2018-12-03 15:44:30,468 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:44:30,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:44:30,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:44:30,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 15:44:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:44:30,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 15:44:30,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-12-03 15:44:30,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:30,501 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 15:44:30,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:44:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 15:44:30,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:44:30,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:30,502 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 15:44:30,503 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:30,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:30,503 INFO L82 PathProgramCache]: Analyzing trace with hash 894126414, now seen corresponding path program 1 times [2018-12-03 15:44:30,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:30,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:30,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:30,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:30,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:30,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:44:30,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:44:30,581 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:44:30,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:44:30,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:44:30,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:44:30,583 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2018-12-03 15:44:30,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:30,719 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-12-03 15:44:30,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:44:30,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-12-03 15:44:30,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:30,720 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:44:30,720 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:44:30,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:44:30,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:44:30,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-12-03 15:44:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:44:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-03 15:44:30,726 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-12-03 15:44:30,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:30,726 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-03 15:44:30,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:44:30,727 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-03 15:44:30,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:44:30,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:30,727 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-03 15:44:30,728 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:30,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:30,728 INFO L82 PathProgramCache]: Analyzing trace with hash 261957866, now seen corresponding path program 1 times [2018-12-03 15:44:30,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:30,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:30,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:30,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:30,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:30,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:30,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:30,813 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:30,814 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 15:44:30,816 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [13], [15], [17] [2018-12-03 15:44:30,857 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:44:30,857 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:44:31,156 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:44:31,158 INFO L272 AbstractInterpreter]: Visited 7 different actions 29 times. Merged at 6 different actions 19 times. Widened at 2 different actions 2 times. Found 5 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:44:31,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:31,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:44:31,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:31,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:31,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:31,228 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:44:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:31,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:31,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:31,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:31,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:31,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2018-12-03 15:44:31,747 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:31,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:44:31,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:44:31,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:44:31,749 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 8 states. [2018-12-03 15:44:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:31,907 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-12-03 15:44:31,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:44:31,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:44:31,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:31,908 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:44:31,909 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:44:31,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:44:31,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:44:31,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 15:44:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:44:31,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-12-03 15:44:31,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2018-12-03 15:44:31,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:31,914 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-12-03 15:44:31,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:44:31,914 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2018-12-03 15:44:31,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:44:31,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:31,915 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-12-03 15:44:31,915 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:31,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:31,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1187669281, now seen corresponding path program 2 times [2018-12-03 15:44:31,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:31,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:31,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:31,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:31,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:32,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:32,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:32,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:32,122 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:32,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:32,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:32,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:32,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:44:32,134 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:44:32,151 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:44:32,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:32,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:32,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:32,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:32,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2018-12-03 15:44:32,317 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:32,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:44:32,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:44:32,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:44:32,318 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 8 states. [2018-12-03 15:44:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:32,440 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-12-03 15:44:32,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:44:32,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 15:44:32,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:32,442 INFO L225 Difference]: With dead ends: 18 [2018-12-03 15:44:32,442 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:44:32,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:44:32,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:44:32,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-12-03 15:44:32,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:44:32,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-12-03 15:44:32,447 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2018-12-03 15:44:32,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:32,447 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-12-03 15:44:32,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:44:32,448 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-12-03 15:44:32,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:44:32,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:32,448 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2018-12-03 15:44:32,449 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:32,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:32,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1111188483, now seen corresponding path program 3 times [2018-12-03 15:44:32,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:32,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:32,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:32,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:32,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:32,636 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:32,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:32,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:32,637 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:32,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:32,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:32,638 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:32,655 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:44:32,656 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:44:32,702 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:44:32,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:32,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:32,934 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:32,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:32,988 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:33,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:33,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-12-03 15:44:33,007 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:33,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:44:33,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:44:33,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:44:33,008 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 11 states. [2018-12-03 15:44:33,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:33,105 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-12-03 15:44:33,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:44:33,105 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:44:33,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:33,106 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:44:33,106 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:44:33,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:44:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:44:33,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 15:44:33,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:44:33,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-03 15:44:33,110 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2018-12-03 15:44:33,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:33,111 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-03 15:44:33,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:44:33,111 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-12-03 15:44:33,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:44:33,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:33,112 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2018-12-03 15:44:33,112 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:33,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:33,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1227431834, now seen corresponding path program 4 times [2018-12-03 15:44:33,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:33,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:33,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:33,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:33,114 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:33,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:33,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:33,245 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:33,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:33,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:33,246 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:33,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:33,256 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:44:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:33,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:33,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:33,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:33,386 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:33,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:33,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2018-12-03 15:44:33,406 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:33,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:44:33,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:44:33,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:44:33,407 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 9 states. [2018-12-03 15:44:33,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:33,576 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-12-03 15:44:33,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:44:33,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 15:44:33,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:33,578 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:44:33,578 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:44:33,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:44:33,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:44:33,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-12-03 15:44:33,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:44:33,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-03 15:44:33,584 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-12-03 15:44:33,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:33,584 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-03 15:44:33,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:44:33,585 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-03 15:44:33,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:44:33,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:33,585 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2018-12-03 15:44:33,586 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:33,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:33,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1553947138, now seen corresponding path program 5 times [2018-12-03 15:44:33,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:33,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:33,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:33,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:33,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:33,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:33,845 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:33,846 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:33,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:33,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:33,846 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:33,855 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:44:33,855 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:44:33,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:44:33,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:33,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:34,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:34,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:34,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2018-12-03 15:44:34,193 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:34,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:44:34,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:44:34,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:44:34,194 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 14 states. [2018-12-03 15:44:34,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:34,303 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-12-03 15:44:34,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:44:34,303 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-03 15:44:34,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:34,304 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:44:34,304 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:44:34,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:44:34,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:44:34,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 15:44:34,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:44:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-12-03 15:44:34,309 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-12-03 15:44:34,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:34,309 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-12-03 15:44:34,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:44:34,309 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-12-03 15:44:34,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:44:34,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:34,310 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1] [2018-12-03 15:44:34,310 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:34,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:34,310 INFO L82 PathProgramCache]: Analyzing trace with hash 291918073, now seen corresponding path program 6 times [2018-12-03 15:44:34,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:34,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:34,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:34,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:34,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:34,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:34,456 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:34,456 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:34,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:34,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:34,457 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:34,473 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:44:34,473 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:44:34,514 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:44:34,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:34,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:34,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:34,599 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:34,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:34,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 9 [2018-12-03 15:44:34,619 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:34,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:44:34,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:44:34,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:44:34,620 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 10 states. [2018-12-03 15:44:34,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:34,747 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-12-03 15:44:34,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:44:34,748 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-12-03 15:44:34,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:34,749 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:44:34,749 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:44:34,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:44:34,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:44:34,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-12-03 15:44:34,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:44:34,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-12-03 15:44:34,754 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2018-12-03 15:44:34,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:34,756 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-12-03 15:44:34,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:44:34,756 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-12-03 15:44:34,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:44:34,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:34,757 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2018-12-03 15:44:34,757 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:34,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:34,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1360327125, now seen corresponding path program 7 times [2018-12-03 15:44:34,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:34,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:34,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:34,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:34,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:34,924 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:34,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:34,924 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:34,925 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:34,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:34,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:34,925 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:34,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:34,934 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:44:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:34,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:35,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:35,163 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:35,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:35,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2018-12-03 15:44:35,182 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:35,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:44:35,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:44:35,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:44:35,183 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 17 states. [2018-12-03 15:44:35,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:35,387 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-12-03 15:44:35,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:44:35,387 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-12-03 15:44:35,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:35,388 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:44:35,388 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:44:35,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:44:35,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:44:35,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 15:44:35,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:44:35,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-03 15:44:35,393 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2018-12-03 15:44:35,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:35,393 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-03 15:44:35,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:44:35,393 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-03 15:44:35,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:44:35,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:35,394 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2018-12-03 15:44:35,394 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:35,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:35,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1898806402, now seen corresponding path program 8 times [2018-12-03 15:44:35,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:35,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:35,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:35,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:35,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:35,520 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:35,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:35,521 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:35,521 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:35,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:35,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:35,522 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:35,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:44:35,535 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:44:35,552 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:44:35,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:35,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:35,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:35,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:35,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 10 [2018-12-03 15:44:35,683 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:35,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:44:35,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:44:35,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:44:35,684 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 11 states. [2018-12-03 15:44:36,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:36,114 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-12-03 15:44:36,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:44:36,114 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-12-03 15:44:36,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:36,115 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:44:36,115 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:44:36,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 10 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:44:36,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:44:36,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-12-03 15:44:36,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 15:44:36,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-03 15:44:36,122 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-12-03 15:44:36,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:36,122 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-03 15:44:36,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:44:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-03 15:44:36,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:44:36,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:36,123 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1] [2018-12-03 15:44:36,123 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:36,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:36,124 INFO L82 PathProgramCache]: Analyzing trace with hash 608081690, now seen corresponding path program 9 times [2018-12-03 15:44:36,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:36,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:36,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:36,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:36,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:36,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:36,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:36,397 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:36,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:36,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:36,398 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:36,406 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:44:36,407 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:44:36,423 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:44:36,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:36,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:36,695 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:36,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:36,853 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:36,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:36,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2018-12-03 15:44:36,872 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:36,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:44:36,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:44:36,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:44:36,873 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 20 states. [2018-12-03 15:44:37,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:37,036 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-12-03 15:44:37,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:44:37,037 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-12-03 15:44:37,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:37,037 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:44:37,037 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:44:37,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 11 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:44:37,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:44:37,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 15:44:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 15:44:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-12-03 15:44:37,044 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2018-12-03 15:44:37,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:37,044 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-12-03 15:44:37,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:44:37,044 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-12-03 15:44:37,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:44:37,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:37,045 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1] [2018-12-03 15:44:37,045 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:37,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:37,046 INFO L82 PathProgramCache]: Analyzing trace with hash -208127791, now seen corresponding path program 10 times [2018-12-03 15:44:37,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:37,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:37,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:37,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:37,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:37,233 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:37,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:37,233 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:37,234 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:37,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:37,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:37,234 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:37,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:37,243 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:44:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:37,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:37,337 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:37,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:37,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:37,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 11 [2018-12-03 15:44:37,496 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:37,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:44:37,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:44:37,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:44:37,498 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 12 states. [2018-12-03 15:44:37,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:37,652 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-12-03 15:44:37,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:44:37,657 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-12-03 15:44:37,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:37,658 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:44:37,658 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:44:37,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 12 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:44:37,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:44:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-12-03 15:44:37,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 15:44:37,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-12-03 15:44:37,665 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 21 [2018-12-03 15:44:37,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:37,665 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-12-03 15:44:37,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:44:37,665 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-12-03 15:44:37,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 15:44:37,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:37,666 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1] [2018-12-03 15:44:37,666 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:37,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:37,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1852588973, now seen corresponding path program 11 times [2018-12-03 15:44:37,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:37,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:37,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:37,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:37,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:37,864 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:37,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:37,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:37,865 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:37,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:37,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:37,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:37,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:44:37,874 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:44:37,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 15:44:37,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:37,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:38,252 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:38,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:38,336 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:38,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:38,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2018-12-03 15:44:38,355 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:38,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:44:38,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:44:38,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:44:38,356 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 23 states. [2018-12-03 15:44:38,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:38,810 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-12-03 15:44:38,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:44:38,811 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-03 15:44:38,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:38,812 INFO L225 Difference]: With dead ends: 42 [2018-12-03 15:44:38,812 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:44:38,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:44:38,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:44:38,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 15:44:38,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 15:44:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-03 15:44:38,819 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2018-12-03 15:44:38,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:38,819 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-03 15:44:38,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:44:38,819 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-03 15:44:38,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:44:38,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:38,820 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1] [2018-12-03 15:44:38,820 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:38,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:38,821 INFO L82 PathProgramCache]: Analyzing trace with hash -34196842, now seen corresponding path program 12 times [2018-12-03 15:44:38,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:38,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:38,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:38,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:38,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:38,955 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:38,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:38,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:38,956 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:38,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:38,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:38,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:38,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:44:38,966 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:44:38,984 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:44:38,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:38,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:39,035 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:39,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:39,136 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:39,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:39,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 12 [2018-12-03 15:44:39,157 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:39,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:44:39,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:44:39,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:44:39,158 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2018-12-03 15:44:39,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:39,325 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-12-03 15:44:39,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:44:39,325 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-12-03 15:44:39,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:39,326 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:44:39,327 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:44:39,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 14 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:44:39,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:44:39,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-12-03 15:44:39,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 15:44:39,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-03 15:44:39,335 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-12-03 15:44:39,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:39,335 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-03 15:44:39,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:44:39,335 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-03 15:44:39,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:44:39,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:39,336 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2018-12-03 15:44:39,337 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:39,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:39,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1496506418, now seen corresponding path program 13 times [2018-12-03 15:44:39,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:39,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:39,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:39,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:39,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:39,693 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:39,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:39,694 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:39,694 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:39,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:39,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:39,694 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:39,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:39,713 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:44:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:39,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:39,925 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:39,925 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:40,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:40,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2018-12-03 15:44:40,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:40,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:44:40,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:44:40,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:44:40,060 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 26 states. [2018-12-03 15:44:40,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:40,391 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-12-03 15:44:40,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:44:40,392 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-12-03 15:44:40,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:40,393 INFO L225 Difference]: With dead ends: 47 [2018-12-03 15:44:40,393 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:44:40,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 28 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:44:40,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:44:40,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 15:44:40,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 15:44:40,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-12-03 15:44:40,400 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-12-03 15:44:40,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:40,400 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-12-03 15:44:40,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:44:40,400 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-12-03 15:44:40,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 15:44:40,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:40,401 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1] [2018-12-03 15:44:40,401 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:40,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:40,402 INFO L82 PathProgramCache]: Analyzing trace with hash 497294505, now seen corresponding path program 14 times [2018-12-03 15:44:40,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:40,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:40,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:40,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:40,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 36 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:40,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:40,556 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:40,556 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:40,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:40,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:40,556 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:40,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:44:40,564 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:44:40,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 15:44:40,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:40,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:40,654 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 36 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:40,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 36 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:40,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:40,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 13 [2018-12-03 15:44:40,760 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:40,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:44:40,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:44:40,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:44:40,760 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 14 states. [2018-12-03 15:44:40,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:40,914 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-12-03 15:44:40,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:44:40,914 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2018-12-03 15:44:40,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:40,915 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:44:40,915 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:44:40,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 16 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=317, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:44:40,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:44:40,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-12-03 15:44:40,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 15:44:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-12-03 15:44:40,921 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2018-12-03 15:44:40,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:40,922 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-12-03 15:44:40,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:44:40,922 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-03 15:44:40,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 15:44:40,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:40,923 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1] [2018-12-03 15:44:40,923 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:40,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:40,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1158582661, now seen corresponding path program 15 times [2018-12-03 15:44:40,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:40,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:40,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:40,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:40,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:41,243 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 72 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:41,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:41,243 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:41,244 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:41,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:41,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:41,244 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:41,254 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:44:41,254 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:44:41,273 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:44:41,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:41,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 72 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:41,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:41,935 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 72 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:41,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:41,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2018-12-03 15:44:41,959 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:41,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 15:44:41,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 15:44:41,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:44:41,961 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 29 states. [2018-12-03 15:44:42,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:42,241 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-12-03 15:44:42,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:44:42,241 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-03 15:44:42,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:42,242 INFO L225 Difference]: With dead ends: 52 [2018-12-03 15:44:42,242 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:44:42,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 31 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:44:42,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:44:42,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 15:44:42,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 15:44:42,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-03 15:44:42,249 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2018-12-03 15:44:42,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:42,249 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-03 15:44:42,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 15:44:42,249 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-03 15:44:42,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:44:42,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:42,250 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1] [2018-12-03 15:44:42,250 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:42,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:42,251 INFO L82 PathProgramCache]: Analyzing trace with hash 2054811054, now seen corresponding path program 16 times [2018-12-03 15:44:42,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:42,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:42,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:42,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:42,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:42,430 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:42,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:42,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:42,431 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:42,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:42,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:42,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:42,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:42,441 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:44:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:42,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:42,495 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:42,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:42,614 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:42,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:42,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 14 [2018-12-03 15:44:42,636 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:42,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:44:42,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:44:42,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:44:42,637 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 15 states. [2018-12-03 15:44:42,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:42,810 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-12-03 15:44:42,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:44:42,813 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2018-12-03 15:44:42,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:42,814 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:44:42,814 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:44:42,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 18 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=376, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:44:42,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:44:42,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-12-03 15:44:42,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 15:44:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-03 15:44:42,822 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-12-03 15:44:42,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:42,823 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-03 15:44:42,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:44:42,823 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-03 15:44:42,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 15:44:42,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:42,824 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1] [2018-12-03 15:44:42,824 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:42,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:42,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1011600054, now seen corresponding path program 17 times [2018-12-03 15:44:42,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:42,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:42,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:42,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:42,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:43,440 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 90 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:43,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:43,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:43,441 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:43,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:43,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:43,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:43,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:44:43,451 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:44:43,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 15:44:43,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:43,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 90 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:43,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:43,876 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 90 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:43,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:43,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2018-12-03 15:44:43,895 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:43,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:44:43,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:44:43,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:44:43,896 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 32 states. [2018-12-03 15:44:44,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:44,649 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-12-03 15:44:44,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:44:44,650 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-12-03 15:44:44,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:44,650 INFO L225 Difference]: With dead ends: 57 [2018-12-03 15:44:44,651 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:44:44,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 34 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=436, Invalid=1286, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:44:44,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:44:44,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 15:44:44,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 15:44:44,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-12-03 15:44:44,661 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2018-12-03 15:44:44,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:44,661 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-12-03 15:44:44,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:44:44,661 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-12-03 15:44:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 15:44:44,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:44,662 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1] [2018-12-03 15:44:44,663 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:44,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:44,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1011743873, now seen corresponding path program 18 times [2018-12-03 15:44:44,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:44,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:44,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:44,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:44,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:44,845 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:44,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:44,845 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:44,845 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:44,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:44,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:44,846 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:44,854 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:44:44,854 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:44:44,883 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:44:44,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:44,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:44,915 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:44,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:45,353 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:45,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:45,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 15 [2018-12-03 15:44:45,389 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:45,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:44:45,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:44:45,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:44:45,390 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 16 states. [2018-12-03 15:44:45,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:45,972 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-12-03 15:44:45,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:44:45,973 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-12-03 15:44:45,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:45,973 INFO L225 Difference]: With dead ends: 42 [2018-12-03 15:44:45,974 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 15:44:45,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 53 SyntacticMatches, 20 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=262, Invalid=440, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:44:45,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 15:44:45,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-12-03 15:44:45,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 15:44:45,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-12-03 15:44:45,982 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 33 [2018-12-03 15:44:45,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:45,982 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-12-03 15:44:45,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:44:45,983 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-12-03 15:44:45,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 15:44:45,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:45,984 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1] [2018-12-03 15:44:45,984 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:45,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:45,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1623186269, now seen corresponding path program 19 times [2018-12-03 15:44:45,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:45,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:45,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:45,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:45,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 110 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:46,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:46,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:46,278 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:46,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:46,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:46,279 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:46,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:46,289 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:44:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:46,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:46,571 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 110 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:46,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 110 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:47,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:47,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 34 [2018-12-03 15:44:47,259 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:47,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 15:44:47,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 15:44:47,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:44:47,260 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 35 states. [2018-12-03 15:44:47,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:47,545 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-12-03 15:44:47,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:44:47,545 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-03 15:44:47,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:47,546 INFO L225 Difference]: With dead ends: 62 [2018-12-03 15:44:47,546 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:44:47,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 37 SyntacticMatches, 21 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=518, Invalid=1552, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:44:47,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:44:47,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 15:44:47,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 15:44:47,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-03 15:44:47,554 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2018-12-03 15:44:47,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:47,554 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-03 15:44:47,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 15:44:47,554 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-03 15:44:47,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 15:44:47,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:47,555 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1] [2018-12-03 15:44:47,556 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:47,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:47,556 INFO L82 PathProgramCache]: Analyzing trace with hash -803883834, now seen corresponding path program 20 times [2018-12-03 15:44:47,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:47,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:47,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:47,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:47,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:47,738 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 66 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:47,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:47,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:47,739 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:47,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:47,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:47,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:47,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:44:47,749 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:44:47,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 15:44:47,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:47,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:47,856 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 66 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:47,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:47,990 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 66 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:48,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:48,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 16 [2018-12-03 15:44:48,010 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:48,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:44:48,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:44:48,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:44:48,011 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 17 states. [2018-12-03 15:44:48,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:48,213 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-12-03 15:44:48,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:44:48,215 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-12-03 15:44:48,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:48,215 INFO L225 Difference]: With dead ends: 45 [2018-12-03 15:44:48,215 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 15:44:48,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 58 SyntacticMatches, 22 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=303, Invalid=509, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:44:48,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 15:44:48,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-12-03 15:44:48,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 15:44:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-03 15:44:48,224 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-12-03 15:44:48,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:48,225 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-03 15:44:48,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:44:48,225 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-03 15:44:48,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 15:44:48,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:48,226 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1] [2018-12-03 15:44:48,226 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:48,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:48,226 INFO L82 PathProgramCache]: Analyzing trace with hash 561682018, now seen corresponding path program 21 times [2018-12-03 15:44:48,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:48,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:48,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:48,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:48,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:48,503 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 132 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:48,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:48,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:48,504 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:48,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:48,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:48,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:48,513 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:44:48,513 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:44:48,539 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:44:48,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:48,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:48,811 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 132 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:48,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:48,988 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 132 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:49,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:49,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2018-12-03 15:44:49,008 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:49,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:44:49,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:44:49,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:44:49,010 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 38 states. [2018-12-03 15:44:49,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:49,420 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-12-03 15:44:49,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:44:49,420 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-12-03 15:44:49,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:49,421 INFO L225 Difference]: With dead ends: 67 [2018-12-03 15:44:49,421 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 15:44:49,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 40 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=607, Invalid=1843, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:44:49,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 15:44:49,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 15:44:49,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 15:44:49,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-12-03 15:44:49,431 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-12-03 15:44:49,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:49,431 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-12-03 15:44:49,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:44:49,431 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-12-03 15:44:49,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 15:44:49,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:49,432 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 1, 1, 1, 1] [2018-12-03 15:44:49,432 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:49,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:49,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1490671705, now seen corresponding path program 22 times [2018-12-03 15:44:49,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:49,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:49,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:49,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:49,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:50,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:50,234 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:50,234 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:50,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:50,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:50,234 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:50,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:50,242 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:44:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:50,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:50,521 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:50,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:51,004 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:51,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:51,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 17 [2018-12-03 15:44:51,022 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:51,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:44:51,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:44:51,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:44:51,023 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 18 states. [2018-12-03 15:44:51,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:51,272 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-12-03 15:44:51,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:44:51,273 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-12-03 15:44:51,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:51,273 INFO L225 Difference]: With dead ends: 48 [2018-12-03 15:44:51,273 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 15:44:51,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 63 SyntacticMatches, 24 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=347, Invalid=583, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:44:51,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 15:44:51,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-12-03 15:44:51,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 15:44:51,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-12-03 15:44:51,283 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 39 [2018-12-03 15:44:51,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:51,284 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-03 15:44:51,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:44:51,284 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-12-03 15:44:51,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 15:44:51,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:51,285 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1] [2018-12-03 15:44:51,285 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:51,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:51,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1983635147, now seen corresponding path program 23 times [2018-12-03 15:44:51,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:51,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:51,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:51,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:51,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:52,188 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 156 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:52,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:52,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:52,189 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:52,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:52,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:52,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:52,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:44:52,202 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:44:52,242 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 15:44:52,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:52,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 156 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:52,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:52,974 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 156 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:52,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:52,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 40 [2018-12-03 15:44:52,994 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:52,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 15:44:52,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 15:44:52,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=1236, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:44:52,995 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 41 states. [2018-12-03 15:44:53,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:53,461 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-12-03 15:44:53,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:44:53,461 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-12-03 15:44:53,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:53,462 INFO L225 Difference]: With dead ends: 72 [2018-12-03 15:44:53,462 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 15:44:53,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 43 SyntacticMatches, 25 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=703, Invalid=2159, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:44:53,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 15:44:53,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 15:44:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 15:44:53,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-03 15:44:53,468 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2018-12-03 15:44:53,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:53,468 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-03 15:44:53,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 15:44:53,469 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-03 15:44:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 15:44:53,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:53,469 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 1, 1, 1, 1] [2018-12-03 15:44:53,469 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:53,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:53,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1073842142, now seen corresponding path program 24 times [2018-12-03 15:44:53,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:53,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:53,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:53,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:53,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:53,721 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:53,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:53,722 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:53,722 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:53,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:53,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:53,722 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:53,730 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:44:53,730 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:44:53,761 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:44:53,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:53,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:53,781 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:53,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:53,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:53,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 18 [2018-12-03 15:44:53,980 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:53,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:44:53,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:44:53,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:44:53,981 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 19 states. [2018-12-03 15:44:54,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:54,210 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-12-03 15:44:54,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:44:54,214 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-12-03 15:44:54,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:54,214 INFO L225 Difference]: With dead ends: 51 [2018-12-03 15:44:54,215 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 15:44:54,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 68 SyntacticMatches, 26 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:44:54,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 15:44:54,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-12-03 15:44:54,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 15:44:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-03 15:44:54,226 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-12-03 15:44:54,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:54,226 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-03 15:44:54,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:44:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-03 15:44:54,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 15:44:54,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:54,227 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1] [2018-12-03 15:44:54,227 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:54,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:54,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1170080634, now seen corresponding path program 25 times [2018-12-03 15:44:54,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:54,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:54,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:54,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:54,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:54,662 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:54,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:54,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:54,663 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:54,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:54,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:54,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:54,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:54,672 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:44:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:54,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:55,076 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:55,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:55,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:55,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2018-12-03 15:44:55,368 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:55,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 15:44:55,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 15:44:55,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:44:55,369 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 44 states. [2018-12-03 15:44:55,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:55,815 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-12-03 15:44:55,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:44:55,815 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-12-03 15:44:55,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:55,816 INFO L225 Difference]: With dead ends: 77 [2018-12-03 15:44:55,816 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 15:44:55,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 46 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=806, Invalid=2500, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:44:55,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 15:44:55,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 15:44:55,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 15:44:55,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-12-03 15:44:55,824 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 44 [2018-12-03 15:44:55,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:55,824 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-12-03 15:44:55,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 15:44:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-12-03 15:44:55,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 15:44:55,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:55,825 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 1, 1, 1, 1] [2018-12-03 15:44:55,825 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:55,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:55,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1190416335, now seen corresponding path program 26 times [2018-12-03 15:44:55,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:55,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:55,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:55,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:55,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:56,840 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 105 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:56,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:56,840 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:56,840 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:56,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:56,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:56,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:56,849 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:44:56,850 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:44:56,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 15:44:56,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:56,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 105 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:56,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:57,357 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 105 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:57,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:57,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 19 [2018-12-03 15:44:57,376 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:57,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:44:57,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:44:57,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:44:57,377 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 20 states. [2018-12-03 15:44:57,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:57,632 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-12-03 15:44:57,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:44:57,633 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2018-12-03 15:44:57,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:57,634 INFO L225 Difference]: With dead ends: 54 [2018-12-03 15:44:57,634 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 15:44:57,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 73 SyntacticMatches, 28 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=444, Invalid=746, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:44:57,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 15:44:57,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-12-03 15:44:57,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 15:44:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-12-03 15:44:57,641 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 45 [2018-12-03 15:44:57,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:57,642 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-12-03 15:44:57,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:44:57,642 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-12-03 15:44:57,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 15:44:57,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:57,642 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1] [2018-12-03 15:44:57,643 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:57,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:57,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1528863987, now seen corresponding path program 27 times [2018-12-03 15:44:57,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:57,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:57,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:57,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:57,644 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 210 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:58,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:58,080 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:58,080 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:58,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:58,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:58,080 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:58,090 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:44:58,090 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:44:58,125 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:44:58,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:58,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:58,519 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 210 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:58,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:58,781 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 210 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:58,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:58,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2018-12-03 15:44:58,801 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:58,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 15:44:58,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 15:44:58,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:44:58,803 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 47 states. [2018-12-03 15:44:59,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:59,270 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-12-03 15:44:59,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:44:59,270 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-03 15:44:59,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:59,271 INFO L225 Difference]: With dead ends: 82 [2018-12-03 15:44:59,271 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 15:44:59,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 49 SyntacticMatches, 29 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:44:59,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 15:44:59,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 15:44:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 15:44:59,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-12-03 15:44:59,279 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2018-12-03 15:44:59,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:59,279 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-12-03 15:44:59,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 15:44:59,279 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-12-03 15:44:59,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 15:44:59,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:59,280 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1] [2018-12-03 15:44:59,280 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:59,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:59,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1594530058, now seen corresponding path program 28 times [2018-12-03 15:44:59,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:59,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:59,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:59,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:59,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 120 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:59,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:59,533 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:59,533 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:59,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:59,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:59,533 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:59,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:59,544 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:44:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:59,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 120 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:59,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:59,803 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 120 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:59,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:59,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 20 [2018-12-03 15:44:59,822 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:59,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:44:59,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:44:59,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:44:59,823 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 21 states. [2018-12-03 15:45:00,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:00,094 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-12-03 15:45:00,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 15:45:00,095 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2018-12-03 15:45:00,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:00,096 INFO L225 Difference]: With dead ends: 57 [2018-12-03 15:45:00,096 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 15:45:00,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 78 SyntacticMatches, 30 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=497, Invalid=835, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:45:00,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 15:45:00,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-12-03 15:45:00,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 15:45:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-03 15:45:00,104 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-12-03 15:45:00,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:00,105 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-03 15:45:00,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:45:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-03 15:45:00,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 15:45:00,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:00,105 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1] [2018-12-03 15:45:00,105 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:00,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:00,106 INFO L82 PathProgramCache]: Analyzing trace with hash 959872146, now seen corresponding path program 29 times [2018-12-03 15:45:00,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:00,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:00,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:00,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:00,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:00,610 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 240 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:00,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:00,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:00,611 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:00,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:00,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:00,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:00,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:45:00,620 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:45:00,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 15:45:00,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:00,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:01,161 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 240 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:01,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:01,458 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 240 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:01,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:01,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2018-12-03 15:45:01,478 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:01,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 15:45:01,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 15:45:01,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:45:01,480 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 50 states. [2018-12-03 15:45:02,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:02,011 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-12-03 15:45:02,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:45:02,012 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-12-03 15:45:02,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:02,013 INFO L225 Difference]: With dead ends: 87 [2018-12-03 15:45:02,013 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 15:45:02,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 52 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:45:02,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 15:45:02,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 15:45:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 15:45:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-12-03 15:45:02,021 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2018-12-03 15:45:02,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:02,021 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-12-03 15:45:02,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 15:45:02,021 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-12-03 15:45:02,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 15:45:02,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:02,022 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 1, 1, 1, 1] [2018-12-03 15:45:02,022 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:02,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:02,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1087929335, now seen corresponding path program 30 times [2018-12-03 15:45:02,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:02,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:02,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:02,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:02,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 136 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:03,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:03,170 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:03,170 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:03,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:03,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:03,170 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:03,178 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:45:03,178 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:45:03,216 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:45:03,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:03,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:03,239 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 136 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:03,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:03,605 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 136 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:03,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:03,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 21 [2018-12-03 15:45:03,623 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:03,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:45:03,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:45:03,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:45:03,624 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 22 states. [2018-12-03 15:45:04,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:04,016 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-12-03 15:45:04,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:45:04,017 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-12-03 15:45:04,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:04,018 INFO L225 Difference]: With dead ends: 60 [2018-12-03 15:45:04,018 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 15:45:04,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 83 SyntacticMatches, 32 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=553, Invalid=929, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:45:04,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 15:45:04,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-12-03 15:45:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 15:45:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-12-03 15:45:04,031 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 51 [2018-12-03 15:45:04,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:04,031 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-12-03 15:45:04,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:45:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-12-03 15:45:04,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 15:45:04,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:04,032 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1] [2018-12-03 15:45:04,032 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:04,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:04,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1823104795, now seen corresponding path program 31 times [2018-12-03 15:45:04,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:04,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:04,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:04,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:04,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:04,678 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 272 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:04,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:04,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:04,679 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:04,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:04,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:04,679 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:04,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:04,698 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:45:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:04,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:05,233 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 272 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:05,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:05,567 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 272 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:05,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:05,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2018-12-03 15:45:05,586 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:05,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 15:45:05,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 15:45:05,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:45:05,588 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 53 states. [2018-12-03 15:45:06,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:06,512 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-12-03 15:45:06,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:45:06,512 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-12-03 15:45:06,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:06,512 INFO L225 Difference]: With dead ends: 92 [2018-12-03 15:45:06,512 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 15:45:06,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 55 SyntacticMatches, 33 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 15:45:06,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 15:45:06,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 15:45:06,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 15:45:06,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-12-03 15:45:06,522 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 53 [2018-12-03 15:45:06,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:06,523 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-12-03 15:45:06,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 15:45:06,523 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-12-03 15:45:06,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 15:45:06,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:06,524 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 1, 1, 1, 1] [2018-12-03 15:45:06,524 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:06,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:06,524 INFO L82 PathProgramCache]: Analyzing trace with hash 2133414414, now seen corresponding path program 32 times [2018-12-03 15:45:06,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:06,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:06,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:06,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:06,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:06,762 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 153 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:06,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:06,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:06,763 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:06,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:06,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:06,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:06,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:45:06,772 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:45:06,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 15:45:06,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:06,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:06,864 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 153 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:06,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 153 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:07,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:07,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 22 [2018-12-03 15:45:07,122 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:07,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:45:07,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:45:07,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:45:07,124 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 23 states. [2018-12-03 15:45:07,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:07,604 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-12-03 15:45:07,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:45:07,605 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2018-12-03 15:45:07,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:07,606 INFO L225 Difference]: With dead ends: 63 [2018-12-03 15:45:07,606 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 15:45:07,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 88 SyntacticMatches, 34 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=612, Invalid=1028, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:45:07,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 15:45:07,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-12-03 15:45:07,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 15:45:07,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-03 15:45:07,619 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2018-12-03 15:45:07,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:07,619 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-03 15:45:07,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:45:07,619 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-03 15:45:07,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 15:45:07,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:07,620 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1] [2018-12-03 15:45:07,620 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:07,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:07,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1511784874, now seen corresponding path program 33 times [2018-12-03 15:45:07,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:07,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:07,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:07,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:07,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 306 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:08,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:08,129 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:08,130 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:08,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:08,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:08,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:08,139 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:45:08,139 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:45:08,180 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:45:08,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:08,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:08,727 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 306 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:08,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:09,111 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 306 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:09,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:09,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 55 [2018-12-03 15:45:09,130 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:09,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 15:45:09,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 15:45:09,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=739, Invalid=2341, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:45:09,131 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 56 states. [2018-12-03 15:45:10,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:10,014 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2018-12-03 15:45:10,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 15:45:10,014 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-12-03 15:45:10,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:10,015 INFO L225 Difference]: With dead ends: 97 [2018-12-03 15:45:10,015 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 15:45:10,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 58 SyntacticMatches, 35 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1802 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1288, Invalid=4114, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:45:10,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 15:45:10,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 15:45:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 15:45:10,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-12-03 15:45:10,025 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 56 [2018-12-03 15:45:10,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:10,025 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-12-03 15:45:10,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 15:45:10,026 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-12-03 15:45:10,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 15:45:10,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:10,026 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 1, 1, 1, 1] [2018-12-03 15:45:10,026 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:10,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:10,027 INFO L82 PathProgramCache]: Analyzing trace with hash -906931231, now seen corresponding path program 34 times [2018-12-03 15:45:10,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:10,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:10,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:10,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:10,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:10,372 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 171 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:10,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:10,372 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:10,372 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:10,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:10,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:10,372 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:10,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:10,382 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:45:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:10,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:10,468 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 171 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:10,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 171 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:10,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:10,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 23 [2018-12-03 15:45:10,967 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:10,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:45:10,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:45:10,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:45:10,968 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 24 states. [2018-12-03 15:45:11,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:11,298 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-12-03 15:45:11,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 15:45:11,299 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 57 [2018-12-03 15:45:11,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:11,300 INFO L225 Difference]: With dead ends: 66 [2018-12-03 15:45:11,300 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 15:45:11,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 93 SyntacticMatches, 36 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=674, Invalid=1132, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 15:45:11,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 15:45:11,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-12-03 15:45:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 15:45:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-12-03 15:45:11,311 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 57 [2018-12-03 15:45:11,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:11,312 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-12-03 15:45:11,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:45:11,312 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-12-03 15:45:11,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 15:45:11,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:11,312 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1] [2018-12-03 15:45:11,312 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:11,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:11,313 INFO L82 PathProgramCache]: Analyzing trace with hash 317381309, now seen corresponding path program 35 times [2018-12-03 15:45:11,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:11,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:11,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:11,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:11,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:12,019 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 342 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:12,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:12,019 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:12,019 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:12,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:12,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:12,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:12,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:45:12,029 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:45:12,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 15:45:12,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:12,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:12,952 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 342 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:12,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:13,388 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 342 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:13,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:13,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2018-12-03 15:45:13,408 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:13,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 15:45:13,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 15:45:13,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:45:13,409 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 59 states. [2018-12-03 15:45:14,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:14,264 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-12-03 15:45:14,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:45:14,264 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-12-03 15:45:14,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:14,265 INFO L225 Difference]: With dead ends: 102 [2018-12-03 15:45:14,265 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 15:45:14,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 61 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 15:45:14,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 15:45:14,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 15:45:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 15:45:14,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-12-03 15:45:14,278 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2018-12-03 15:45:14,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:14,278 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-12-03 15:45:14,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 15:45:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-12-03 15:45:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 15:45:14,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:14,279 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 1, 1, 1, 1] [2018-12-03 15:45:14,279 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:14,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:14,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1012222246, now seen corresponding path program 36 times [2018-12-03 15:45:14,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:14,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:14,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:14,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:14,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:14,669 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 190 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:14,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:14,669 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:14,670 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:14,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:14,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:14,670 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:14,678 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:45:14,678 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:45:14,727 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:45:14,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:14,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:14,848 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 190 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:14,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:15,229 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 190 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:15,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:15,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 24 [2018-12-03 15:45:15,250 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:15,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:45:15,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:45:15,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:45:15,250 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 25 states. [2018-12-03 15:45:15,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:15,624 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-12-03 15:45:15,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 15:45:15,624 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 60 [2018-12-03 15:45:15,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:15,625 INFO L225 Difference]: With dead ends: 69 [2018-12-03 15:45:15,625 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 15:45:15,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 98 SyntacticMatches, 38 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=739, Invalid=1241, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 15:45:15,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 15:45:15,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-12-03 15:45:15,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 15:45:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-03 15:45:15,640 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-12-03 15:45:15,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:15,640 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-03 15:45:15,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:45:15,640 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-03 15:45:15,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 15:45:15,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:15,641 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1] [2018-12-03 15:45:15,641 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:15,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:15,641 INFO L82 PathProgramCache]: Analyzing trace with hash 2082902722, now seen corresponding path program 37 times [2018-12-03 15:45:15,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:15,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:15,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:15,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:15,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 380 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:16,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:16,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:16,299 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:16,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:16,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:16,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:16,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:16,309 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:45:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:16,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 380 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:17,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:18,413 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 380 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:18,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:18,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 61 [2018-12-03 15:45:18,433 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:18,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 15:45:18,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 15:45:18,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=901, Invalid=2881, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:45:18,434 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 62 states. [2018-12-03 15:45:19,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:19,375 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-12-03 15:45:19,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 15:45:19,375 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-12-03 15:45:19,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:19,376 INFO L225 Difference]: With dead ends: 107 [2018-12-03 15:45:19,376 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 15:45:19,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 64 SyntacticMatches, 39 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2242 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1571, Invalid=5071, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 15:45:19,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 15:45:19,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 15:45:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 15:45:19,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-12-03 15:45:19,388 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2018-12-03 15:45:19,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:19,388 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-12-03 15:45:19,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 15:45:19,388 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-12-03 15:45:19,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 15:45:19,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:19,389 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1] [2018-12-03 15:45:19,389 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:19,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:19,390 INFO L82 PathProgramCache]: Analyzing trace with hash 346890169, now seen corresponding path program 38 times [2018-12-03 15:45:19,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:19,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:19,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:19,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:19,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 210 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:19,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:19,792 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:19,793 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:19,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:19,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:19,793 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:19,801 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:45:19,802 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:45:19,867 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 15:45:19,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:19,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:19,920 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 210 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:19,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:20,304 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 210 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:20,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:20,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 25 [2018-12-03 15:45:20,323 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:20,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:45:20,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:45:20,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:45:20,324 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 26 states. [2018-12-03 15:45:20,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:20,704 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-12-03 15:45:20,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 15:45:20,704 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 63 [2018-12-03 15:45:20,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:20,705 INFO L225 Difference]: With dead ends: 72 [2018-12-03 15:45:20,706 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 15:45:20,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 103 SyntacticMatches, 40 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=807, Invalid=1355, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:45:20,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 15:45:20,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-12-03 15:45:20,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 15:45:20,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-12-03 15:45:20,720 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 63 [2018-12-03 15:45:20,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:20,720 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-12-03 15:45:20,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:45:20,720 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-12-03 15:45:20,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 15:45:20,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:20,721 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1] [2018-12-03 15:45:20,721 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:20,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:20,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1646063467, now seen corresponding path program 39 times [2018-12-03 15:45:20,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:20,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:20,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:20,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:20,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:21,422 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 420 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:21,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:21,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:21,422 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:21,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:21,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:21,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:21,432 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:45:21,433 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:45:21,495 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:45:21,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:21,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:22,207 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 420 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:22,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:23,072 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 420 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:23,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:23,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2018-12-03 15:45:23,091 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:23,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 15:45:23,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 15:45:23,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 15:45:23,093 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 65 states. [2018-12-03 15:45:24,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:24,589 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2018-12-03 15:45:24,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 15:45:24,589 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-12-03 15:45:24,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:24,590 INFO L225 Difference]: With dead ends: 112 [2018-12-03 15:45:24,590 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 15:45:24,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 67 SyntacticMatches, 41 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1723, Invalid=5587, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:45:24,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 15:45:24,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 15:45:24,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 15:45:24,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-12-03 15:45:24,606 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 65 [2018-12-03 15:45:24,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:24,606 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-12-03 15:45:24,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 15:45:24,607 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-12-03 15:45:24,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 15:45:24,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:24,607 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 1, 1, 1, 1] [2018-12-03 15:45:24,607 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:24,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:24,608 INFO L82 PathProgramCache]: Analyzing trace with hash 800148542, now seen corresponding path program 40 times [2018-12-03 15:45:24,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:24,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:24,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:24,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:24,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:25,094 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 231 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:25,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:25,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:25,095 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:25,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:25,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:25,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:25,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:25,105 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:45:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:25,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:25,226 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 231 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:25,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 231 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:25,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:25,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 26 [2018-12-03 15:45:25,711 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:25,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:45:25,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:45:25,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=397, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:45:25,712 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 27 states. [2018-12-03 15:45:26,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:26,104 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-12-03 15:45:26,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 15:45:26,104 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 66 [2018-12-03 15:45:26,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:26,105 INFO L225 Difference]: With dead ends: 75 [2018-12-03 15:45:26,105 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 15:45:26,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 108 SyntacticMatches, 42 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=878, Invalid=1474, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 15:45:26,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 15:45:26,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-12-03 15:45:26,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 15:45:26,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-03 15:45:26,122 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2018-12-03 15:45:26,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:26,122 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-03 15:45:26,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:45:26,122 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-03 15:45:26,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 15:45:26,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:26,123 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1] [2018-12-03 15:45:26,123 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:26,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:26,123 INFO L82 PathProgramCache]: Analyzing trace with hash 143536090, now seen corresponding path program 41 times [2018-12-03 15:45:26,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:26,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:26,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:26,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:26,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:27,397 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 462 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:27,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:27,398 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:27,398 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:27,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:27,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:27,398 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:27,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:45:27,407 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:45:27,473 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 15:45:27,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:27,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 462 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:28,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:29,209 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 462 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:29,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:29,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 67 [2018-12-03 15:45:29,228 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:29,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 15:45:29,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 15:45:29,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1079, Invalid=3477, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 15:45:29,229 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 68 states. [2018-12-03 15:45:30,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:30,030 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-12-03 15:45:30,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 15:45:30,030 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-12-03 15:45:30,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:30,031 INFO L225 Difference]: With dead ends: 117 [2018-12-03 15:45:30,032 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 15:45:30,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 70 SyntacticMatches, 43 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2730 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1882, Invalid=6128, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 15:45:30,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 15:45:30,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 15:45:30,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 15:45:30,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-12-03 15:45:30,046 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 68 [2018-12-03 15:45:30,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:30,046 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-12-03 15:45:30,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 15:45:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-12-03 15:45:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 15:45:30,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:30,047 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 1, 1, 1, 1] [2018-12-03 15:45:30,047 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:30,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:30,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1759582319, now seen corresponding path program 42 times [2018-12-03 15:45:30,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:30,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:30,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:30,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:30,048 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 253 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:30,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:30,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:30,517 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:30,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:30,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:30,517 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:30,525 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:45:30,526 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:45:30,578 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:45:30,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:30,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:30,606 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 253 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:30,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:30,996 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 253 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:31,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:31,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 27 [2018-12-03 15:45:31,015 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:31,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:45:31,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:45:31,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:45:31,016 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 28 states. [2018-12-03 15:45:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:31,420 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-12-03 15:45:31,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 15:45:31,421 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 69 [2018-12-03 15:45:31,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:31,422 INFO L225 Difference]: With dead ends: 78 [2018-12-03 15:45:31,422 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 15:45:31,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 113 SyntacticMatches, 44 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=952, Invalid=1598, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 15:45:31,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 15:45:31,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-12-03 15:45:31,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 15:45:31,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-12-03 15:45:31,437 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 69 [2018-12-03 15:45:31,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:31,437 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-12-03 15:45:31,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:45:31,438 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-12-03 15:45:31,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 15:45:31,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:31,438 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1] [2018-12-03 15:45:31,438 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:31,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:31,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1258439277, now seen corresponding path program 43 times [2018-12-03 15:45:31,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:31,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:31,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:31,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:31,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:32,283 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 506 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:32,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:32,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:32,283 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:32,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:32,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:32,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:32,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:32,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:45:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:32,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 506 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:33,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:34,106 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 506 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:34,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:34,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 70 [2018-12-03 15:45:34,125 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:34,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 15:45:34,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 15:45:34,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:45:34,126 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 71 states. [2018-12-03 15:45:34,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:34,914 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2018-12-03 15:45:34,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 15:45:34,914 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-12-03 15:45:34,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:34,915 INFO L225 Difference]: With dead ends: 122 [2018-12-03 15:45:34,915 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 15:45:34,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 73 SyntacticMatches, 45 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2048, Invalid=6694, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 15:45:34,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 15:45:34,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 15:45:34,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 15:45:34,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-12-03 15:45:34,931 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2018-12-03 15:45:34,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:34,931 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-12-03 15:45:34,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 15:45:34,931 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-12-03 15:45:34,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 15:45:34,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:34,932 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 1, 1, 1, 1] [2018-12-03 15:45:34,932 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:34,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:34,932 INFO L82 PathProgramCache]: Analyzing trace with hash -973776042, now seen corresponding path program 44 times [2018-12-03 15:45:34,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:34,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:34,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:34,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:34,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:35,281 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 276 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:35,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:35,281 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:35,281 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:35,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:35,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:35,281 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:35,290 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:45:35,290 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:45:35,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 15:45:35,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:35,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:35,487 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 276 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:35,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:35,944 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 276 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:35,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:35,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 28 [2018-12-03 15:45:35,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:35,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 15:45:35,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 15:45:35,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:45:35,964 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 29 states. [2018-12-03 15:45:36,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:36,407 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-12-03 15:45:36,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 15:45:36,407 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 72 [2018-12-03 15:45:36,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:36,408 INFO L225 Difference]: With dead ends: 81 [2018-12-03 15:45:36,408 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 15:45:36,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 118 SyntacticMatches, 46 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1029, Invalid=1727, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:45:36,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 15:45:36,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-12-03 15:45:36,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 15:45:36,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-12-03 15:45:36,424 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-12-03 15:45:36,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:36,425 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-12-03 15:45:36,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 15:45:36,425 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-12-03 15:45:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 15:45:36,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:36,425 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1, 1] [2018-12-03 15:45:36,425 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:36,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:36,426 INFO L82 PathProgramCache]: Analyzing trace with hash 504027378, now seen corresponding path program 45 times [2018-12-03 15:45:36,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:36,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:36,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:36,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:36,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 552 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:37,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:37,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:37,475 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:37,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:37,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:37,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:37,485 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:45:37,485 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:45:37,541 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:45:37,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:37,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:39,407 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 552 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:39,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 552 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:40,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:40,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 73 [2018-12-03 15:45:40,458 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:40,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 15:45:40,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 15:45:40,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:45:40,459 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 74 states. [2018-12-03 15:45:41,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:41,851 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-12-03 15:45:41,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 15:45:41,851 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-12-03 15:45:41,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:41,852 INFO L225 Difference]: With dead ends: 127 [2018-12-03 15:45:41,852 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 15:45:41,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 76 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2221, Invalid=7285, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 15:45:41,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 15:45:41,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 15:45:41,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 15:45:41,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-12-03 15:45:41,866 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2018-12-03 15:45:41,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:41,866 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-12-03 15:45:41,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 15:45:41,867 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-12-03 15:45:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 15:45:41,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:41,867 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 1, 1, 1, 1] [2018-12-03 15:45:41,867 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:41,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:41,867 INFO L82 PathProgramCache]: Analyzing trace with hash -443896983, now seen corresponding path program 46 times [2018-12-03 15:45:41,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:41,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:41,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:41,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:41,868 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:43,442 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 300 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:43,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:43,442 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:43,442 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:43,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:43,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:43,443 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:43,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:43,451 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:45:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:43,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:43,550 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 300 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:43,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:44,000 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 300 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:44,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:44,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 29 [2018-12-03 15:45:44,019 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:44,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:45:44,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:45:44,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:45:44,020 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 30 states. [2018-12-03 15:45:44,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:44,480 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2018-12-03 15:45:44,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 15:45:44,481 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 75 [2018-12-03 15:45:44,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:44,482 INFO L225 Difference]: With dead ends: 84 [2018-12-03 15:45:44,482 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 15:45:44,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 123 SyntacticMatches, 48 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1109, Invalid=1861, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:45:44,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 15:45:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-12-03 15:45:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 15:45:44,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-12-03 15:45:44,499 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 75 [2018-12-03 15:45:44,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:44,499 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-12-03 15:45:44,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:45:44,499 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-12-03 15:45:44,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 15:45:44,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:44,499 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1, 1] [2018-12-03 15:45:44,500 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:44,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:44,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1383305147, now seen corresponding path program 47 times [2018-12-03 15:45:44,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:44,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:44,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:44,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:44,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:45,479 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 600 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:45,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:45,480 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:45,480 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:45,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:45,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:45,480 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:45,489 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:45:45,489 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:45:45,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 15:45:45,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:45,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:46,605 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 600 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:46,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:47,338 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 600 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:47,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:47,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 76 [2018-12-03 15:45:47,358 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:47,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 15:45:47,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 15:45:47,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 15:45:47,359 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 77 states. [2018-12-03 15:45:48,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:48,945 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2018-12-03 15:45:48,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:45:48,945 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-12-03 15:45:48,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:48,945 INFO L225 Difference]: With dead ends: 132 [2018-12-03 15:45:48,945 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 15:45:48,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 79 SyntacticMatches, 49 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:45:48,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 15:45:48,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 15:45:48,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 15:45:48,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-12-03 15:45:48,961 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 77 [2018-12-03 15:45:48,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:48,961 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-12-03 15:45:48,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 15:45:48,961 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-12-03 15:45:48,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 15:45:48,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:48,962 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 1, 1, 1, 1] [2018-12-03 15:45:48,962 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:48,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:48,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1587972498, now seen corresponding path program 48 times [2018-12-03 15:45:48,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:48,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:48,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:48,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:48,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 325 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:50,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:50,081 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:50,081 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:50,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:50,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:50,082 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:50,090 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:45:50,090 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:45:50,149 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:45:50,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:50,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:50,191 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 325 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:50,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:50,810 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 325 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:50,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:50,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 30 [2018-12-03 15:45:50,831 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:50,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 15:45:50,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 15:45:50,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:45:50,831 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 31 states. [2018-12-03 15:45:51,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:51,537 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-12-03 15:45:51,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 15:45:51,538 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 78 [2018-12-03 15:45:51,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:51,538 INFO L225 Difference]: With dead ends: 87 [2018-12-03 15:45:51,539 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 15:45:51,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 128 SyntacticMatches, 50 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1192, Invalid=2000, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 15:45:51,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 15:45:51,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2018-12-03 15:45:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 15:45:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-12-03 15:45:51,557 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-12-03 15:45:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:51,557 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-12-03 15:45:51,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 15:45:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-12-03 15:45:51,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 15:45:51,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:51,558 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1, 1, 1] [2018-12-03 15:45:51,558 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:51,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:51,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1328247286, now seen corresponding path program 49 times [2018-12-03 15:45:51,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:51,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:51,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:51,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:51,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 650 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:52,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:52,951 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:52,952 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:52,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:52,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:52,952 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:52,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:52,960 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:45:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:53,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:54,414 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 650 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:54,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:55,200 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 650 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:55,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:55,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 79 [2018-12-03 15:45:55,219 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:55,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 15:45:55,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 15:45:55,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:45:55,221 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 80 states. [2018-12-03 15:45:56,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:56,821 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2018-12-03 15:45:56,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 15:45:56,821 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-12-03 15:45:56,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:56,822 INFO L225 Difference]: With dead ends: 137 [2018-12-03 15:45:56,822 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 15:45:56,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 82 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2588, Invalid=8542, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 15:45:56,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 15:45:56,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 15:45:56,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 15:45:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-12-03 15:45:56,842 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 80 [2018-12-03 15:45:56,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:56,842 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-12-03 15:45:56,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 15:45:56,843 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-12-03 15:45:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 15:45:56,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:56,843 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 1, 1, 1, 1] [2018-12-03 15:45:56,844 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:56,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:56,844 INFO L82 PathProgramCache]: Analyzing trace with hash 280259393, now seen corresponding path program 50 times [2018-12-03 15:45:56,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:56,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:56,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:56,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:56,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 351 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:58,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:58,101 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:58,101 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:58,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:58,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:58,102 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:58,120 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:45:58,121 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:45:58,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 15:45:58,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:58,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:58,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 351 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:58,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:59,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 351 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:59,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:59,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 31 [2018-12-03 15:45:59,105 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:59,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:45:59,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:45:59,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:45:59,106 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 32 states. [2018-12-03 15:46:00,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:00,300 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2018-12-03 15:46:00,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 15:46:00,300 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 81 [2018-12-03 15:46:00,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:00,301 INFO L225 Difference]: With dead ends: 90 [2018-12-03 15:46:00,302 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 15:46:00,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 133 SyntacticMatches, 52 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1484 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1278, Invalid=2144, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:46:00,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 15:46:00,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-12-03 15:46:00,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 15:46:00,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-12-03 15:46:00,322 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 81 [2018-12-03 15:46:00,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:00,322 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-12-03 15:46:00,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:46:00,322 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-12-03 15:46:00,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 15:46:00,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:00,323 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1, 1, 1] [2018-12-03 15:46:00,323 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:00,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:00,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1253729763, now seen corresponding path program 51 times [2018-12-03 15:46:00,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:00,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:00,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:00,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:00,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:01,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 702 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:01,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:01,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:01,574 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:01,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:01,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:01,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:01,584 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:46:01,585 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:46:01,646 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:46:01,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:01,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:02,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 702 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:02,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:04,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 702 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:04,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:04,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 82 [2018-12-03 15:46:04,159 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:04,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 15:46:04,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 15:46:04,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1594, Invalid=5212, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 15:46:04,160 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 83 states. [2018-12-03 15:46:05,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:05,814 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2018-12-03 15:46:05,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 15:46:05,814 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-12-03 15:46:05,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:05,815 INFO L225 Difference]: With dead ends: 142 [2018-12-03 15:46:05,815 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 15:46:05,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 85 SyntacticMatches, 53 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4160 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2782, Invalid=9208, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 15:46:05,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 15:46:05,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 15:46:05,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 15:46:05,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-12-03 15:46:05,833 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2018-12-03 15:46:05,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:05,833 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-12-03 15:46:05,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 15:46:05,833 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-12-03 15:46:05,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 15:46:05,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:05,833 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 1, 1, 1, 1] [2018-12-03 15:46:05,834 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:05,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:05,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1181377146, now seen corresponding path program 52 times [2018-12-03 15:46:05,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:05,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:05,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:05,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:05,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 378 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:06,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:06,256 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:06,256 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:06,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:06,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:06,257 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:06,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:06,265 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:46:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:06,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 378 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:06,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:07,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 378 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:07,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:07,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 32 [2018-12-03 15:46:07,158 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:07,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 15:46:07,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 15:46:07,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=586, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:46:07,159 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 33 states. [2018-12-03 15:46:07,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:07,709 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2018-12-03 15:46:07,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 15:46:07,710 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 84 [2018-12-03 15:46:07,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:07,711 INFO L225 Difference]: With dead ends: 93 [2018-12-03 15:46:07,711 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 15:46:07,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 138 SyntacticMatches, 54 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1367, Invalid=2293, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:46:07,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 15:46:07,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2018-12-03 15:46:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 15:46:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-12-03 15:46:07,731 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2018-12-03 15:46:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:07,731 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-12-03 15:46:07,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 15:46:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-12-03 15:46:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 15:46:07,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:07,732 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1, 1, 1] [2018-12-03 15:46:07,732 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:07,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:07,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1432137950, now seen corresponding path program 53 times [2018-12-03 15:46:07,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:07,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:07,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:07,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:07,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 756 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:09,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:09,265 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:09,265 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:09,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:09,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:09,266 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:09,275 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:46:09,276 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:46:09,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 15:46:09,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:09,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 756 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:10,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:11,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 756 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:11,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:11,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 85 [2018-12-03 15:46:11,523 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:11,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 15:46:11,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 15:46:11,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:46:11,524 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 86 states. [2018-12-03 15:46:13,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:13,257 INFO L93 Difference]: Finished difference Result 147 states and 149 transitions. [2018-12-03 15:46:13,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 15:46:13,257 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-12-03 15:46:13,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:13,258 INFO L225 Difference]: With dead ends: 147 [2018-12-03 15:46:13,259 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 15:46:13,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 88 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2983, Invalid=9899, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 15:46:13,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 15:46:13,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 15:46:13,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 15:46:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-12-03 15:46:13,279 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2018-12-03 15:46:13,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:13,279 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-12-03 15:46:13,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 15:46:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-12-03 15:46:13,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 15:46:13,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:13,280 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 1, 1, 1, 1] [2018-12-03 15:46:13,280 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:13,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:13,280 INFO L82 PathProgramCache]: Analyzing trace with hash -2048907495, now seen corresponding path program 54 times [2018-12-03 15:46:13,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:13,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:13,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:13,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:13,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:13,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 406 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:13,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:13,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:13,901 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:13,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:13,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:13,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:13,910 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:46:13,910 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:46:13,976 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:46:13,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:13,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:14,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 406 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:14,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:14,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 406 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:14,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:14,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 33 [2018-12-03 15:46:14,743 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:14,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:46:14,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:46:14,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:46:14,744 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 34 states. [2018-12-03 15:46:15,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:15,294 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2018-12-03 15:46:15,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 15:46:15,295 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 87 [2018-12-03 15:46:15,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:15,295 INFO L225 Difference]: With dead ends: 96 [2018-12-03 15:46:15,295 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 15:46:15,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 143 SyntacticMatches, 56 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1459, Invalid=2447, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 15:46:15,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 15:46:15,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2018-12-03 15:46:15,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 15:46:15,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-12-03 15:46:15,324 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 87 [2018-12-03 15:46:15,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:15,324 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-12-03 15:46:15,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:46:15,324 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-12-03 15:46:15,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 15:46:15,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:15,325 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1, 1, 1] [2018-12-03 15:46:15,325 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:15,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:15,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1905147915, now seen corresponding path program 55 times [2018-12-03 15:46:15,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:15,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:15,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:15,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:15,327 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:16,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 812 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:16,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:16,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:16,458 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:16,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:16,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:16,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:16,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:16,471 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:46:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:16,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:17,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 812 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:17,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:18,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 812 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:18,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:18,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 88 [2018-12-03 15:46:18,844 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:18,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 15:46:18,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 15:46:18,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 15:46:18,845 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 89 states. [2018-12-03 15:46:20,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:20,945 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2018-12-03 15:46:20,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 15:46:20,945 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-12-03 15:46:20,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:20,946 INFO L225 Difference]: With dead ends: 152 [2018-12-03 15:46:20,946 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 15:46:20,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 91 SyntacticMatches, 57 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3191, Invalid=10615, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 15:46:20,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 15:46:20,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 15:46:20,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 15:46:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-12-03 15:46:20,975 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 89 [2018-12-03 15:46:20,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:20,976 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-12-03 15:46:20,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 15:46:20,976 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-12-03 15:46:20,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 15:46:20,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:20,977 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 1, 1, 1, 1] [2018-12-03 15:46:20,977 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:20,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:20,978 INFO L82 PathProgramCache]: Analyzing trace with hash 2078396574, now seen corresponding path program 56 times [2018-12-03 15:46:20,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:20,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:20,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:20,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:20,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:21,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 435 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:21,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:21,870 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:21,870 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:21,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:21,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:21,871 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:21,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:46:21,880 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:46:21,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 15:46:21,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:21,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:22,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 435 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:22,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:22,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 435 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:22,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:22,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 34 [2018-12-03 15:46:22,839 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:22,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 15:46:22,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 15:46:22,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:46:22,840 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 35 states. [2018-12-03 15:46:23,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:23,461 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2018-12-03 15:46:23,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 15:46:23,462 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 90 [2018-12-03 15:46:23,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:23,463 INFO L225 Difference]: With dead ends: 99 [2018-12-03 15:46:23,463 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 15:46:23,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 148 SyntacticMatches, 58 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1554, Invalid=2606, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 15:46:23,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 15:46:23,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-12-03 15:46:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 15:46:23,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-12-03 15:46:23,493 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-12-03 15:46:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:23,493 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-12-03 15:46:23,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 15:46:23,494 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-12-03 15:46:23,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 15:46:23,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:23,494 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1, 1, 1] [2018-12-03 15:46:23,494 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:23,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:23,495 INFO L82 PathProgramCache]: Analyzing trace with hash 179248186, now seen corresponding path program 57 times [2018-12-03 15:46:23,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:23,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:23,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:23,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:23,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:24,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 870 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:24,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:24,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:24,983 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:24,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:24,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:24,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:24,992 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:46:24,992 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:46:25,066 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:46:25,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:25,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:26,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 870 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:26,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 870 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:27,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:27,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 91 [2018-12-03 15:46:27,600 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:27,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 15:46:27,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 15:46:27,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 15:46:27,602 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 92 states. [2018-12-03 15:46:29,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:29,826 INFO L93 Difference]: Finished difference Result 157 states and 159 transitions. [2018-12-03 15:46:29,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 15:46:29,826 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-12-03 15:46:29,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:29,827 INFO L225 Difference]: With dead ends: 157 [2018-12-03 15:46:29,827 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 15:46:29,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 94 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:46:29,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 15:46:29,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 15:46:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 15:46:29,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-12-03 15:46:29,848 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 92 [2018-12-03 15:46:29,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:29,848 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-12-03 15:46:29,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 15:46:29,848 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-12-03 15:46:29,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 15:46:29,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:29,849 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 1, 1, 1, 1] [2018-12-03 15:46:29,849 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:29,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:29,849 INFO L82 PathProgramCache]: Analyzing trace with hash -288235791, now seen corresponding path program 58 times [2018-12-03 15:46:29,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:29,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:29,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:29,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:29,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 465 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:30,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:30,351 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:30,351 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:30,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:30,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:30,351 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:30,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:30,363 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:46:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:30,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:30,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 465 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:30,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 465 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:31,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:31,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 35 [2018-12-03 15:46:31,181 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:31,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:46:31,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:46:31,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:46:31,182 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 36 states. [2018-12-03 15:46:31,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:31,831 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2018-12-03 15:46:31,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 15:46:31,832 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 93 [2018-12-03 15:46:31,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:31,833 INFO L225 Difference]: With dead ends: 102 [2018-12-03 15:46:31,833 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 15:46:31,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 153 SyntacticMatches, 60 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1952 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1652, Invalid=2770, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 15:46:31,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 15:46:31,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2018-12-03 15:46:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 15:46:31,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-12-03 15:46:31,856 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 93 [2018-12-03 15:46:31,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:31,856 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-12-03 15:46:31,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:46:31,856 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-12-03 15:46:31,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 15:46:31,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:31,857 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1, 1, 1] [2018-12-03 15:46:31,857 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:31,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:31,857 INFO L82 PathProgramCache]: Analyzing trace with hash -2116754995, now seen corresponding path program 59 times [2018-12-03 15:46:31,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:31,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:31,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:31,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:31,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:33,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 930 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:33,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:33,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:33,128 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:33,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:33,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:33,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:33,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:46:33,136 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:46:33,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 15:46:33,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:33,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:35,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 930 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:35,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 930 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:36,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:36,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 94 [2018-12-03 15:46:36,984 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:36,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 15:46:36,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 15:46:36,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 15:46:36,986 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 95 states. [2018-12-03 15:46:38,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:38,240 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2018-12-03 15:46:38,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 15:46:38,240 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-12-03 15:46:38,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:38,240 INFO L225 Difference]: With dead ends: 162 [2018-12-03 15:46:38,241 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 15:46:38,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 97 SyntacticMatches, 61 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 15:46:38,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 15:46:38,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 15:46:38,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 15:46:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-03 15:46:38,267 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2018-12-03 15:46:38,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:38,267 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-03 15:46:38,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 15:46:38,268 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-03 15:46:38,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 15:46:38,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:38,268 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 1, 1, 1, 1] [2018-12-03 15:46:38,268 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:38,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:38,268 INFO L82 PathProgramCache]: Analyzing trace with hash -352972874, now seen corresponding path program 60 times [2018-12-03 15:46:38,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:38,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:38,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:38,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:38,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 496 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:38,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:38,933 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:38,933 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:38,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:38,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:38,933 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:38,942 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:46:38,942 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:46:39,016 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:46:39,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:39,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:39,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 496 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:39,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:40,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 496 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:40,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:40,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 36 [2018-12-03 15:46:40,105 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:40,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 15:46:40,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 15:46:40,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:46:40,106 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 37 states. [2018-12-03 15:46:40,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:40,758 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2018-12-03 15:46:40,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 15:46:40,758 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 96 [2018-12-03 15:46:40,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:40,759 INFO L225 Difference]: With dead ends: 105 [2018-12-03 15:46:40,759 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 15:46:40,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 158 SyntacticMatches, 62 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1753, Invalid=2939, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 15:46:40,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 15:46:40,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-12-03 15:46:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 15:46:40,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-03 15:46:40,784 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-12-03 15:46:40,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:40,784 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-03 15:46:40,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 15:46:40,784 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-03 15:46:40,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 15:46:40,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:40,785 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1, 1, 1] [2018-12-03 15:46:40,785 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:40,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:40,785 INFO L82 PathProgramCache]: Analyzing trace with hash 95417682, now seen corresponding path program 61 times [2018-12-03 15:46:40,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:40,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:40,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:40,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:40,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 992 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:42,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:42,066 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:42,066 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:42,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:42,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:42,066 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:42,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:42,077 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:46:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:42,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 992 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:43,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:45,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 992 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:45,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:45,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 97 [2018-12-03 15:46:45,548 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:45,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 15:46:45,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 15:46:45,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2209, Invalid=7297, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 15:46:45,550 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 98 states. [2018-12-03 15:46:46,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:46,961 INFO L93 Difference]: Finished difference Result 167 states and 169 transitions. [2018-12-03 15:46:46,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 15:46:46,962 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-12-03 15:46:46,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:46,962 INFO L225 Difference]: With dead ends: 167 [2018-12-03 15:46:46,962 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 15:46:46,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 100 SyntacticMatches, 63 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5890 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=3857, Invalid=12913, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 15:46:46,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 15:46:46,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 15:46:46,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 15:46:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-12-03 15:46:46,986 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2018-12-03 15:46:46,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:46,986 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-12-03 15:46:46,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 15:46:46,986 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-12-03 15:46:46,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 15:46:46,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:46,987 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 1, 1, 1, 1] [2018-12-03 15:46:46,987 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:46,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:46,987 INFO L82 PathProgramCache]: Analyzing trace with hash 298685129, now seen corresponding path program 62 times [2018-12-03 15:46:46,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:46,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:46,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:46,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:46,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:47,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 528 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:47,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:47,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:47,520 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:47,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:47,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:47,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:47,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:46:47,530 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:46:47,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 15:46:47,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:47,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 528 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:47,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:48,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 528 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:48,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:48,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 37 [2018-12-03 15:46:48,691 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:48,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:46:48,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:46:48,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:46:48,692 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 38 states. [2018-12-03 15:46:49,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:49,383 INFO L93 Difference]: Finished difference Result 108 states and 109 transitions. [2018-12-03 15:46:49,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 15:46:49,383 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 99 [2018-12-03 15:46:49,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:49,384 INFO L225 Difference]: With dead ends: 108 [2018-12-03 15:46:49,384 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 15:46:49,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 163 SyntacticMatches, 64 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1857, Invalid=3113, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:46:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 15:46:49,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2018-12-03 15:46:49,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 15:46:49,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2018-12-03 15:46:49,410 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 99 [2018-12-03 15:46:49,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:49,410 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2018-12-03 15:46:49,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:46:49,410 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2018-12-03 15:46:49,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 15:46:49,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:49,411 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1, 1, 1] [2018-12-03 15:46:49,411 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:49,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:49,411 INFO L82 PathProgramCache]: Analyzing trace with hash -726466651, now seen corresponding path program 63 times [2018-12-03 15:46:49,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:49,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:49,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:49,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:49,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1056 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:51,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:51,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:51,096 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:51,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:51,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:51,097 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:51,107 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:46:51,107 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:46:51,185 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:46:51,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:51,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1056 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:52,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:54,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1056 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:54,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:54,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2018-12-03 15:46:54,147 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:54,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 15:46:54,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 15:46:54,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 15:46:54,149 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 101 states. [2018-12-03 15:46:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:56,679 INFO L93 Difference]: Finished difference Result 172 states and 174 transitions. [2018-12-03 15:46:56,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 15:46:56,679 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-12-03 15:46:56,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:56,680 INFO L225 Difference]: With dead ends: 172 [2018-12-03 15:46:56,680 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 15:46:56,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 103 SyntacticMatches, 65 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6272 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 15:46:56,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 15:46:56,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 15:46:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 15:46:56,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-12-03 15:46:56,709 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 101 [2018-12-03 15:46:56,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:56,709 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-12-03 15:46:56,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 15:46:56,709 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-12-03 15:46:56,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 15:46:56,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:56,710 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 1, 1, 1, 1] [2018-12-03 15:46:56,710 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:56,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:56,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1089840434, now seen corresponding path program 64 times [2018-12-03 15:46:56,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:56,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:56,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:56,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:56,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 561 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:57,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:57,267 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:57,267 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:57,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:57,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:57,267 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:57,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:57,277 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:46:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:57,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:57,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 561 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:57,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:58,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 561 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:58,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:58,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 38 [2018-12-03 15:46:58,243 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:58,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 15:46:58,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 15:46:58,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=811, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:46:58,244 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 39 states. [2018-12-03 15:46:58,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:58,959 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2018-12-03 15:46:58,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 15:46:58,960 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 102 [2018-12-03 15:46:58,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:58,960 INFO L225 Difference]: With dead ends: 111 [2018-12-03 15:46:58,960 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 15:46:58,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 168 SyntacticMatches, 66 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2345 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1964, Invalid=3292, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 15:46:58,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 15:46:58,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-12-03 15:46:58,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 15:46:58,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-12-03 15:46:58,988 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2018-12-03 15:46:58,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:58,988 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-12-03 15:46:58,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 15:46:58,988 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-12-03 15:46:58,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 15:46:58,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:58,989 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1, 1, 1] [2018-12-03 15:46:58,989 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:58,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:58,989 INFO L82 PathProgramCache]: Analyzing trace with hash 635296362, now seen corresponding path program 65 times [2018-12-03 15:46:58,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:58,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:58,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:58,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:58,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:00,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 1122 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:00,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:00,772 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:00,772 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:00,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:00,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:00,772 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:00,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:00,780 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:00,901 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 15:47:00,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:00,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 1122 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:02,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:04,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 1122 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:04,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:04,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 103 [2018-12-03 15:47:04,056 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:04,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 15:47:04,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 15:47:04,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2483, Invalid=8229, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 15:47:04,058 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 104 states. [2018-12-03 15:47:06,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:06,735 INFO L93 Difference]: Finished difference Result 177 states and 179 transitions. [2018-12-03 15:47:06,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 15:47:06,736 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-12-03 15:47:06,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:06,736 INFO L225 Difference]: With dead ends: 177 [2018-12-03 15:47:06,736 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 15:47:06,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 106 SyntacticMatches, 67 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6666 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=4336, Invalid=14570, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 15:47:06,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 15:47:06,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 15:47:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 15:47:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2018-12-03 15:47:06,773 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 104 [2018-12-03 15:47:06,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:06,773 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2018-12-03 15:47:06,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 15:47:06,773 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2018-12-03 15:47:06,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 15:47:06,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:06,774 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 1, 1, 1, 1] [2018-12-03 15:47:06,774 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:06,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:06,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1315487071, now seen corresponding path program 66 times [2018-12-03 15:47:06,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:06,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:06,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:06,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:06,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:07,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 595 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:07,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:07,354 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:07,354 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:07,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:07,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:07,354 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:07,363 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:07,363 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:07,446 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:07,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:07,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:07,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 595 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:07,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 595 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:08,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:08,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 39 [2018-12-03 15:47:08,394 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:08,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:47:08,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:47:08,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:47:08,395 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 40 states. [2018-12-03 15:47:09,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:09,161 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2018-12-03 15:47:09,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 15:47:09,161 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 105 [2018-12-03 15:47:09,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:09,162 INFO L225 Difference]: With dead ends: 114 [2018-12-03 15:47:09,162 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 15:47:09,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 173 SyntacticMatches, 68 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2484 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2074, Invalid=3476, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 15:47:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 15:47:09,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2018-12-03 15:47:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 15:47:09,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-12-03 15:47:09,191 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 105 [2018-12-03 15:47:09,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:09,191 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-12-03 15:47:09,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:47:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-12-03 15:47:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 15:47:09,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:09,192 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1, 1, 1] [2018-12-03 15:47:09,192 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:09,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:09,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1462756995, now seen corresponding path program 67 times [2018-12-03 15:47:09,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:09,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:09,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:09,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:09,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:10,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1190 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:10,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:10,930 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:10,930 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:10,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:10,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:10,930 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:10,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:10,939 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:11,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1190 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:12,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1190 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:14,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:14,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 106 [2018-12-03 15:47:14,296 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:14,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 15:47:14,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 15:47:14,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=8716, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 15:47:14,297 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 107 states. [2018-12-03 15:47:17,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:17,054 INFO L93 Difference]: Finished difference Result 182 states and 184 transitions. [2018-12-03 15:47:17,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 15:47:17,054 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-12-03 15:47:17,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:17,055 INFO L225 Difference]: With dead ends: 182 [2018-12-03 15:47:17,055 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 15:47:17,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 109 SyntacticMatches, 69 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7072 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4586, Invalid=15436, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 15:47:17,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 15:47:17,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 15:47:17,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 15:47:17,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-12-03 15:47:17,083 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 107 [2018-12-03 15:47:17,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:17,084 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-12-03 15:47:17,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 15:47:17,084 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-12-03 15:47:17,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 15:47:17,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:17,084 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 1, 1, 1, 1] [2018-12-03 15:47:17,084 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:17,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:17,085 INFO L82 PathProgramCache]: Analyzing trace with hash -2049527322, now seen corresponding path program 68 times [2018-12-03 15:47:17,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:17,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:17,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:17,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:17,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:17,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 630 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:17,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:17,706 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:17,706 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:17,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:17,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:17,706 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:17,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:17,715 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:17,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 15:47:17,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:17,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:17,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 630 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:17,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:19,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 630 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:19,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:19,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 40 [2018-12-03 15:47:19,107 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:19,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 15:47:19,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 15:47:19,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:47:19,108 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 41 states. [2018-12-03 15:47:19,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:19,891 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-12-03 15:47:19,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 15:47:19,891 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 108 [2018-12-03 15:47:19,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:19,892 INFO L225 Difference]: With dead ends: 117 [2018-12-03 15:47:19,892 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 15:47:19,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 178 SyntacticMatches, 70 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2627 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2187, Invalid=3665, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 15:47:19,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 15:47:19,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-12-03 15:47:19,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 15:47:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-12-03 15:47:19,922 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-12-03 15:47:19,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:19,922 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-12-03 15:47:19,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 15:47:19,922 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-12-03 15:47:19,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 15:47:19,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:19,923 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1, 1, 1] [2018-12-03 15:47:19,923 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:19,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:19,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1794165634, now seen corresponding path program 69 times [2018-12-03 15:47:19,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:19,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:19,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:19,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:19,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1260 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:21,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:21,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:21,857 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:21,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:21,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:21,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:21,867 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:21,867 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:21,951 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:21,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:21,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:23,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1260 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:23,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:25,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1260 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:25,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:25,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 109 [2018-12-03 15:47:25,479 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:25,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 15:47:25,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 15:47:25,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2773, Invalid=9217, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 15:47:25,480 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 110 states. [2018-12-03 15:47:28,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:28,345 INFO L93 Difference]: Finished difference Result 187 states and 189 transitions. [2018-12-03 15:47:28,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 15:47:28,345 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-12-03 15:47:28,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:28,346 INFO L225 Difference]: With dead ends: 187 [2018-12-03 15:47:28,346 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 15:47:28,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 112 SyntacticMatches, 71 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7490 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=4843, Invalid=16327, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 15:47:28,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 15:47:28,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 15:47:28,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 15:47:28,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2018-12-03 15:47:28,375 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 110 [2018-12-03 15:47:28,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:28,375 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2018-12-03 15:47:28,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 15:47:28,375 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2018-12-03 15:47:28,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 15:47:28,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:28,375 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 1, 1, 1, 1] [2018-12-03 15:47:28,376 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:28,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:28,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1836248697, now seen corresponding path program 70 times [2018-12-03 15:47:28,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:28,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:28,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:28,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:28,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 666 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:29,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:29,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:29,024 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:29,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:29,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:29,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:29,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:29,033 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:29,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:29,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 666 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:29,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 666 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:30,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:30,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 41 [2018-12-03 15:47:30,315 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:30,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 15:47:30,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 15:47:30,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:47:30,316 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 42 states. [2018-12-03 15:47:31,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:31,275 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2018-12-03 15:47:31,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 15:47:31,275 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 111 [2018-12-03 15:47:31,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:31,277 INFO L225 Difference]: With dead ends: 120 [2018-12-03 15:47:31,277 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 15:47:31,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 183 SyntacticMatches, 72 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2774 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2303, Invalid=3859, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 15:47:31,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 15:47:31,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2018-12-03 15:47:31,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 15:47:31,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2018-12-03 15:47:31,313 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 111 [2018-12-03 15:47:31,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:31,313 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2018-12-03 15:47:31,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 15:47:31,313 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2018-12-03 15:47:31,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 15:47:31,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:31,314 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1, 1, 1] [2018-12-03 15:47:31,314 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:31,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:31,314 INFO L82 PathProgramCache]: Analyzing trace with hash -596627627, now seen corresponding path program 71 times [2018-12-03 15:47:31,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:31,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:31,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:31,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:31,315 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1332 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:33,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:33,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:33,022 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:33,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:33,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:33,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:33,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:33,031 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:33,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 15:47:33,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:33,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:35,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1332 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:35,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:37,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1332 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:37,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:37,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 112 [2018-12-03 15:47:37,092 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:37,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-03 15:47:37,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-03 15:47:37,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 15:47:37,093 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 113 states. [2018-12-03 15:47:40,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:40,037 INFO L93 Difference]: Finished difference Result 192 states and 194 transitions. [2018-12-03 15:47:40,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 15:47:40,037 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2018-12-03 15:47:40,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:40,038 INFO L225 Difference]: With dead ends: 192 [2018-12-03 15:47:40,038 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 15:47:40,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 115 SyntacticMatches, 73 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7920 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 15:47:40,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 15:47:40,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 15:47:40,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 15:47:40,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-12-03 15:47:40,069 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 113 [2018-12-03 15:47:40,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:40,070 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-12-03 15:47:40,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-03 15:47:40,070 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-12-03 15:47:40,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 15:47:40,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:40,070 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 1, 1, 1, 1] [2018-12-03 15:47:40,071 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:40,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:40,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1030548226, now seen corresponding path program 72 times [2018-12-03 15:47:40,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:40,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:40,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:40,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:40,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:41,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 703 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:41,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:41,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:41,627 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:41,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:41,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:41,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:41,636 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:41,636 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:41,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:41,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:41,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:41,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 703 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:41,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:42,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 703 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:42,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:42,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 42 [2018-12-03 15:47:42,843 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:42,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 15:47:42,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 15:47:42,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 15:47:42,844 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 43 states. [2018-12-03 15:47:43,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:43,724 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2018-12-03 15:47:43,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 15:47:43,725 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 114 [2018-12-03 15:47:43,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:43,726 INFO L225 Difference]: With dead ends: 123 [2018-12-03 15:47:43,726 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 15:47:43,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 188 SyntacticMatches, 74 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2925 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2422, Invalid=4058, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 15:47:43,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 15:47:43,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2018-12-03 15:47:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-03 15:47:43,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-12-03 15:47:43,760 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2018-12-03 15:47:43,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:43,760 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-12-03 15:47:43,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 15:47:43,760 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-12-03 15:47:43,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 15:47:43,761 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:43,761 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1, 1, 1] [2018-12-03 15:47:43,761 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:43,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:43,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1780533402, now seen corresponding path program 73 times [2018-12-03 15:47:43,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:43,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:43,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:43,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:43,762 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 1406 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:45,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:45,565 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:45,565 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:45,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:45,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:45,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:45,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:45,574 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:45,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:48,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 1406 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:48,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:49,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 1406 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:49,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:49,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 115 [2018-12-03 15:47:49,775 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:49,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-12-03 15:47:49,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-12-03 15:47:49,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3079, Invalid=10261, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 15:47:49,777 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 116 states. [2018-12-03 15:47:53,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:53,032 INFO L93 Difference]: Finished difference Result 197 states and 199 transitions. [2018-12-03 15:47:53,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 15:47:53,033 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2018-12-03 15:47:53,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:53,033 INFO L225 Difference]: With dead ends: 197 [2018-12-03 15:47:53,033 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 15:47:53,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 118 SyntacticMatches, 75 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8362 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=5378, Invalid=18184, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 15:47:53,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 15:47:53,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-12-03 15:47:53,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 15:47:53,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-12-03 15:47:53,065 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 116 [2018-12-03 15:47:53,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:53,065 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-12-03 15:47:53,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-12-03 15:47:53,066 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-12-03 15:47:53,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 15:47:53,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:53,066 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 1, 1, 1, 1] [2018-12-03 15:47:53,067 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:53,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:53,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1591437743, now seen corresponding path program 74 times [2018-12-03 15:47:53,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:53,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:53,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:53,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:53,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 741 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:53,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:53,780 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:53,780 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:53,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:53,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:53,780 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:53,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:53,789 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:53,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 15:47:53,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:53,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 741 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:53,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:55,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 741 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:55,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:55,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 43 [2018-12-03 15:47:55,087 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:55,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 15:47:55,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 15:47:55,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=866, Invalid=1026, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:47:55,087 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 44 states. [2018-12-03 15:47:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:55,963 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2018-12-03 15:47:55,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 15:47:55,964 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 117 [2018-12-03 15:47:55,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:55,965 INFO L225 Difference]: With dead ends: 126 [2018-12-03 15:47:55,965 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 15:47:55,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 193 SyntacticMatches, 76 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2544, Invalid=4262, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 15:47:55,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 15:47:55,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2018-12-03 15:47:55,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 15:47:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-12-03 15:47:56,016 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 117 [2018-12-03 15:47:56,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:56,017 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-12-03 15:47:56,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 15:47:56,017 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-12-03 15:47:56,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 15:47:56,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:56,018 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1, 1, 1] [2018-12-03 15:47:56,018 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:56,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:56,018 INFO L82 PathProgramCache]: Analyzing trace with hash -363380435, now seen corresponding path program 75 times [2018-12-03 15:47:56,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:56,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:56,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:56,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:56,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:58,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 1482 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:58,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:58,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:58,109 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:58,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:58,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:58,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:58,118 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:58,118 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:58,210 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:58,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:58,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 1482 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:00,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:02,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 1482 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:02,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:02,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 118 [2018-12-03 15:48:02,420 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:02,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-12-03 15:48:02,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-12-03 15:48:02,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3238, Invalid=10804, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 15:48:02,422 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 119 states. [2018-12-03 15:48:05,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:05,676 INFO L93 Difference]: Finished difference Result 202 states and 204 transitions. [2018-12-03 15:48:05,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 15:48:05,676 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 119 [2018-12-03 15:48:05,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:05,677 INFO L225 Difference]: With dead ends: 202 [2018-12-03 15:48:05,677 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 15:48:05,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 121 SyntacticMatches, 77 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8816 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=5656, Invalid=19150, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 15:48:05,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 15:48:05,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-03 15:48:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-03 15:48:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-12-03 15:48:05,711 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 119 [2018-12-03 15:48:05,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:05,711 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-12-03 15:48:05,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-12-03 15:48:05,711 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-12-03 15:48:05,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-03 15:48:05,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:05,711 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 1, 1, 1, 1] [2018-12-03 15:48:05,712 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:05,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:05,712 INFO L82 PathProgramCache]: Analyzing trace with hash 234325014, now seen corresponding path program 76 times [2018-12-03 15:48:05,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:05,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:05,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:05,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:05,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 780 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:06,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:06,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:06,687 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:06,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:06,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:06,688 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:06,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:06,695 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:48:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:06,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:06,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 780 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:06,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 780 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:08,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:08,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 44 [2018-12-03 15:48:08,000 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:08,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 15:48:08,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 15:48:08,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=908, Invalid=1072, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 15:48:08,001 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 45 states. [2018-12-03 15:48:08,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:08,913 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2018-12-03 15:48:08,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 15:48:08,913 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 120 [2018-12-03 15:48:08,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:08,914 INFO L225 Difference]: With dead ends: 129 [2018-12-03 15:48:08,914 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 15:48:08,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 198 SyntacticMatches, 78 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3239 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2669, Invalid=4471, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 15:48:08,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 15:48:08,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2018-12-03 15:48:08,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-03 15:48:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-12-03 15:48:08,951 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2018-12-03 15:48:08,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:08,951 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-12-03 15:48:08,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 15:48:08,951 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-12-03 15:48:08,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 15:48:08,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:08,952 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1, 1, 1] [2018-12-03 15:48:08,952 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:08,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:08,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1847972274, now seen corresponding path program 77 times [2018-12-03 15:48:08,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:08,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:08,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:08,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:08,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1560 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:10,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:10,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:10,910 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:10,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:10,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:10,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:10,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:48:10,918 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:48:11,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 15:48:11,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:11,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1560 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:13,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:15,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1560 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:15,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:15,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 121 [2018-12-03 15:48:15,560 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:15,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-12-03 15:48:15,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-12-03 15:48:15,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3401, Invalid=11361, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:48:15,561 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 122 states. [2018-12-03 15:48:19,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:19,108 INFO L93 Difference]: Finished difference Result 207 states and 209 transitions. [2018-12-03 15:48:19,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 15:48:19,108 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 122 [2018-12-03 15:48:19,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:19,109 INFO L225 Difference]: With dead ends: 207 [2018-12-03 15:48:19,109 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 15:48:19,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 124 SyntacticMatches, 79 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9282 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=5941, Invalid=20141, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 15:48:19,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 15:48:19,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 15:48:19,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 15:48:19,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2018-12-03 15:48:19,144 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 122 [2018-12-03 15:48:19,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:19,144 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2018-12-03 15:48:19,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-12-03 15:48:19,145 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2018-12-03 15:48:19,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 15:48:19,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:19,145 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 1, 1, 1, 1] [2018-12-03 15:48:19,145 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:19,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:19,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1156594217, now seen corresponding path program 78 times [2018-12-03 15:48:19,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:19,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:19,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:19,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:19,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:19,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 820 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:19,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:19,943 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:19,943 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:19,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:19,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:19,944 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:19,952 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:48:19,952 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:48:20,052 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:48:20,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:20,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 820 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:20,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:21,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 820 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:21,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:21,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 45 [2018-12-03 15:48:21,329 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:21,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 15:48:21,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 15:48:21,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=1119, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:48:21,330 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 46 states. [2018-12-03 15:48:22,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:22,442 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2018-12-03 15:48:22,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 15:48:22,442 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 123 [2018-12-03 15:48:22,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:22,443 INFO L225 Difference]: With dead ends: 132 [2018-12-03 15:48:22,443 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 15:48:22,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 203 SyntacticMatches, 80 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3402 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2797, Invalid=4685, Unknown=0, NotChecked=0, Total=7482 [2018-12-03 15:48:22,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 15:48:22,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2018-12-03 15:48:22,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 15:48:22,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2018-12-03 15:48:22,496 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 123 [2018-12-03 15:48:22,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:22,496 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2018-12-03 15:48:22,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 15:48:22,496 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2018-12-03 15:48:22,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-03 15:48:22,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:22,497 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1, 1, 1] [2018-12-03 15:48:22,497 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:22,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:22,497 INFO L82 PathProgramCache]: Analyzing trace with hash -909553915, now seen corresponding path program 79 times [2018-12-03 15:48:22,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:22,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:22,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:22,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:22,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 1640 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:24,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:24,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:24,711 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:24,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:24,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:24,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:24,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:24,719 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:48:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:24,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:27,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 1640 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:27,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:29,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 1640 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:29,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:29,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 124 [2018-12-03 15:48:29,630 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:29,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-12-03 15:48:29,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-12-03 15:48:29,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3568, Invalid=11932, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 15:48:29,631 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 125 states. [2018-12-03 15:48:33,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:33,323 INFO L93 Difference]: Finished difference Result 212 states and 214 transitions. [2018-12-03 15:48:33,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 15:48:33,323 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 125 [2018-12-03 15:48:33,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:33,324 INFO L225 Difference]: With dead ends: 212 [2018-12-03 15:48:33,324 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 15:48:33,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 127 SyntacticMatches, 81 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9760 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=6233, Invalid=21157, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 15:48:33,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 15:48:33,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-03 15:48:33,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-03 15:48:33,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-12-03 15:48:33,369 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 125 [2018-12-03 15:48:33,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:33,370 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-12-03 15:48:33,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-12-03 15:48:33,370 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-12-03 15:48:33,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-03 15:48:33,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:33,370 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 1, 1, 1, 1] [2018-12-03 15:48:33,370 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:33,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:33,371 INFO L82 PathProgramCache]: Analyzing trace with hash 909901614, now seen corresponding path program 80 times [2018-12-03 15:48:33,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:33,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:33,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:33,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:33,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:34,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 861 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:34,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:34,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:34,191 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:34,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:34,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:34,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:34,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:48:34,201 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:48:34,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-03 15:48:34,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:34,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:34,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 861 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:34,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 861 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:35,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:35,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 44] total 46 [2018-12-03 15:48:35,686 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:35,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 15:48:35,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 15:48:35,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:48:35,687 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 47 states. [2018-12-03 15:48:36,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:36,698 INFO L93 Difference]: Finished difference Result 135 states and 136 transitions. [2018-12-03 15:48:36,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 15:48:36,698 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 126 [2018-12-03 15:48:36,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:36,699 INFO L225 Difference]: With dead ends: 135 [2018-12-03 15:48:36,699 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 15:48:36,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 208 SyntacticMatches, 82 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3569 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2928, Invalid=4904, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 15:48:36,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 15:48:36,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2018-12-03 15:48:36,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-03 15:48:36,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-12-03 15:48:36,749 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-12-03 15:48:36,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:36,750 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-12-03 15:48:36,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 15:48:36,750 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-12-03 15:48:36,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 15:48:36,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:36,751 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1, 1, 1] [2018-12-03 15:48:36,751 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:36,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:36,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1757944118, now seen corresponding path program 81 times [2018-12-03 15:48:36,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:36,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:36,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:36,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:36,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1722 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:39,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:39,372 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:39,372 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:39,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:39,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:39,372 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:39,380 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:48:39,380 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:48:39,475 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:48:39,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:39,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:42,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1722 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:42,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:44,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1722 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:44,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:44,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 127 [2018-12-03 15:48:44,572 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:44,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-12-03 15:48:44,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-12-03 15:48:44,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3739, Invalid=12517, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 15:48:44,573 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 128 states. [2018-12-03 15:48:48,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:48,497 INFO L93 Difference]: Finished difference Result 217 states and 219 transitions. [2018-12-03 15:48:48,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 15:48:48,498 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 128 [2018-12-03 15:48:48,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:48,498 INFO L225 Difference]: With dead ends: 217 [2018-12-03 15:48:48,499 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 15:48:48,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 130 SyntacticMatches, 83 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10250 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=6532, Invalid=22198, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 15:48:48,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 15:48:48,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-03 15:48:48,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 15:48:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2018-12-03 15:48:48,547 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 128 [2018-12-03 15:48:48,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:48,548 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2018-12-03 15:48:48,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-12-03 15:48:48,548 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2018-12-03 15:48:48,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 15:48:48,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:48,549 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 1, 1, 1, 1] [2018-12-03 15:48:48,549 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:48,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:48,549 INFO L82 PathProgramCache]: Analyzing trace with hash -845555199, now seen corresponding path program 82 times [2018-12-03 15:48:48,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:48,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:48,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:48,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:48,550 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 903 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:49,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:49,413 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:49,413 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:49,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:49,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:49,413 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:49,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:49,426 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:48:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:49,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 903 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:49,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:50,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 903 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:50,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:50,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 47 [2018-12-03 15:48:50,942 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:50,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 15:48:50,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 15:48:50,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1040, Invalid=1216, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:48:50,943 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 48 states. [2018-12-03 15:48:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:52,010 INFO L93 Difference]: Finished difference Result 138 states and 139 transitions. [2018-12-03 15:48:52,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 15:48:52,010 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 129 [2018-12-03 15:48:52,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:52,011 INFO L225 Difference]: With dead ends: 138 [2018-12-03 15:48:52,011 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 15:48:52,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 213 SyntacticMatches, 84 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3740 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3062, Invalid=5128, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 15:48:52,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 15:48:52,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2018-12-03 15:48:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 15:48:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2018-12-03 15:48:52,051 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 129 [2018-12-03 15:48:52,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:52,051 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2018-12-03 15:48:52,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 15:48:52,052 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2018-12-03 15:48:52,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 15:48:52,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:52,052 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1, 1, 1] [2018-12-03 15:48:52,053 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:52,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:52,053 INFO L82 PathProgramCache]: Analyzing trace with hash -829794083, now seen corresponding path program 83 times [2018-12-03 15:48:52,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:52,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:52,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:52,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:52,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:54,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1806 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:54,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:54,589 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:54,589 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:54,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:54,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:54,590 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:54,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:48:54,599 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:48:54,776 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 15:48:54,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:54,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:57,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1806 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:57,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:59,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1806 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:59,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:59,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 130 [2018-12-03 15:48:59,964 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:59,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-12-03 15:48:59,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-12-03 15:48:59,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3914, Invalid=13116, Unknown=0, NotChecked=0, Total=17030 [2018-12-03 15:48:59,966 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 131 states. [2018-12-03 15:49:03,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:03,085 INFO L93 Difference]: Finished difference Result 222 states and 224 transitions. [2018-12-03 15:49:03,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 15:49:03,086 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 131 [2018-12-03 15:49:03,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:03,086 INFO L225 Difference]: With dead ends: 222 [2018-12-03 15:49:03,086 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 15:49:03,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 133 SyntacticMatches, 85 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10752 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=6838, Invalid=23264, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 15:49:03,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 15:49:03,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-03 15:49:03,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 15:49:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-12-03 15:49:03,126 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 131 [2018-12-03 15:49:03,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:03,126 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-12-03 15:49:03,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-12-03 15:49:03,127 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-12-03 15:49:03,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 15:49:03,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:03,127 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 1, 1, 1, 1] [2018-12-03 15:49:03,128 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:03,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:03,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1595442758, now seen corresponding path program 84 times [2018-12-03 15:49:03,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:03,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:03,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:03,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:03,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:04,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 946 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:04,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:04,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:04,143 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:04,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:04,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:04,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:04,152 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:04,152 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:04,258 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:04,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:04,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 946 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:04,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:05,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 946 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:05,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:05,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 48 [2018-12-03 15:49:05,683 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:05,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 15:49:05,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 15:49:05,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 15:49:05,685 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 49 states. [2018-12-03 15:49:06,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:06,738 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2018-12-03 15:49:06,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 15:49:06,739 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 132 [2018-12-03 15:49:06,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:06,740 INFO L225 Difference]: With dead ends: 141 [2018-12-03 15:49:06,740 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 15:49:06,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 218 SyntacticMatches, 86 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3915 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3199, Invalid=5357, Unknown=0, NotChecked=0, Total=8556 [2018-12-03 15:49:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 15:49:06,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-12-03 15:49:06,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-03 15:49:06,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-12-03 15:49:06,781 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-12-03 15:49:06,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:06,781 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-12-03 15:49:06,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 15:49:06,782 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-12-03 15:49:06,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-03 15:49:06,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:06,782 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1, 1, 1] [2018-12-03 15:49:06,783 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:06,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:06,783 INFO L82 PathProgramCache]: Analyzing trace with hash -82901022, now seen corresponding path program 85 times [2018-12-03 15:49:06,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:06,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:06,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:06,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:06,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:09,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1892 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:09,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:09,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:09,427 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:09,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:09,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:09,428 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:09,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:09,441 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:09,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1892 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:12,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1892 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:14,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:14,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 133 [2018-12-03 15:49:14,896 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:14,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-12-03 15:49:14,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-12-03 15:49:14,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 15:49:14,898 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 134 states. [2018-12-03 15:49:17,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:17,937 INFO L93 Difference]: Finished difference Result 227 states and 229 transitions. [2018-12-03 15:49:17,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 15:49:17,937 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 134 [2018-12-03 15:49:17,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:17,937 INFO L225 Difference]: With dead ends: 227 [2018-12-03 15:49:17,938 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 15:49:17,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 136 SyntacticMatches, 87 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11266 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=7151, Invalid=24355, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 15:49:17,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 15:49:17,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-03 15:49:17,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 15:49:17,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2018-12-03 15:49:17,978 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 134 [2018-12-03 15:49:17,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:17,978 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2018-12-03 15:49:17,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-12-03 15:49:17,978 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2018-12-03 15:49:17,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 15:49:17,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:17,979 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 1, 1, 1, 1] [2018-12-03 15:49:17,979 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:17,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:17,979 INFO L82 PathProgramCache]: Analyzing trace with hash 207975897, now seen corresponding path program 86 times [2018-12-03 15:49:17,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:17,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:17,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:17,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:17,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:19,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 990 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:19,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:19,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:19,151 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:19,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:19,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:19,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:19,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:19,160 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:19,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 15:49:19,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:19,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:19,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 990 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:19,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:20,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 990 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:20,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:20,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 49 [2018-12-03 15:49:20,845 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:20,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 15:49:20,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 15:49:20,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:49:20,846 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 50 states. [2018-12-03 15:49:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:21,921 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2018-12-03 15:49:21,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 15:49:21,922 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 135 [2018-12-03 15:49:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:21,922 INFO L225 Difference]: With dead ends: 144 [2018-12-03 15:49:21,922 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 15:49:21,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 223 SyntacticMatches, 88 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4094 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3339, Invalid=5591, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 15:49:21,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 15:49:21,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2018-12-03 15:49:21,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 15:49:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2018-12-03 15:49:21,965 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 135 [2018-12-03 15:49:21,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:21,965 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2018-12-03 15:49:21,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 15:49:21,965 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2018-12-03 15:49:21,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 15:49:21,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:21,966 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1, 1, 1] [2018-12-03 15:49:21,966 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:21,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:21,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1998692683, now seen corresponding path program 87 times [2018-12-03 15:49:21,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:21,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:21,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:21,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:21,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 1980 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:24,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:24,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:24,723 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:24,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:24,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:24,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:24,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:24,735 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:24,846 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:24,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:24,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:27,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 1980 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:27,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:30,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 1980 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:30,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:30,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 136 [2018-12-03 15:49:30,498 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:30,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-12-03 15:49:30,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-12-03 15:49:30,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4276, Invalid=14356, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 15:49:30,500 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 137 states. [2018-12-03 15:49:33,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:33,932 INFO L93 Difference]: Finished difference Result 232 states and 234 transitions. [2018-12-03 15:49:33,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 15:49:33,932 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 137 [2018-12-03 15:49:33,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:33,933 INFO L225 Difference]: With dead ends: 232 [2018-12-03 15:49:33,933 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 15:49:33,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 139 SyntacticMatches, 89 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11792 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=7471, Invalid=25471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 15:49:33,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 15:49:33,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-03 15:49:33,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-03 15:49:33,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-12-03 15:49:33,976 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 137 [2018-12-03 15:49:33,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:33,976 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-12-03 15:49:33,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-12-03 15:49:33,976 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-12-03 15:49:33,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 15:49:33,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:33,976 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 1, 1, 1, 1] [2018-12-03 15:49:33,977 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:33,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:33,977 INFO L82 PathProgramCache]: Analyzing trace with hash 566565214, now seen corresponding path program 88 times [2018-12-03 15:49:33,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:33,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:33,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:33,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:33,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:34,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 1035 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:34,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:34,933 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:34,933 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:34,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:34,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:34,933 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:34,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:34,941 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:35,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:35,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 1035 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:35,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:36,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 1035 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:36,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:36,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 50 [2018-12-03 15:49:36,653 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:36,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 15:49:36,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 15:49:36,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=1369, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 15:49:36,654 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 51 states. [2018-12-03 15:49:37,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:37,761 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2018-12-03 15:49:37,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 15:49:37,761 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 138 [2018-12-03 15:49:37,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:37,762 INFO L225 Difference]: With dead ends: 147 [2018-12-03 15:49:37,762 INFO L226 Difference]: Without dead ends: 145 [2018-12-03 15:49:37,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 228 SyntacticMatches, 90 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4277 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3482, Invalid=5830, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 15:49:37,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-03 15:49:37,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2018-12-03 15:49:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-03 15:49:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-12-03 15:49:37,834 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-12-03 15:49:37,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:37,834 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-12-03 15:49:37,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 15:49:37,834 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-12-03 15:49:37,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-03 15:49:37,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:37,835 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1, 1, 1] [2018-12-03 15:49:37,835 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:37,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:37,836 INFO L82 PathProgramCache]: Analyzing trace with hash -991742726, now seen corresponding path program 89 times [2018-12-03 15:49:37,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:37,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:37,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:37,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:37,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:40,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 2070 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:40,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:40,679 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:40,679 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:40,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:40,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:40,679 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:40,687 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:40,687 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:40,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 15:49:40,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:40,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 2070 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:44,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 2070 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:46,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:46,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 139 [2018-12-03 15:49:46,687 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:46,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-12-03 15:49:46,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-12-03 15:49:46,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4463, Invalid=14997, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 15:49:46,688 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 140 states. [2018-12-03 15:49:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:50,253 INFO L93 Difference]: Finished difference Result 237 states and 239 transitions. [2018-12-03 15:49:50,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 15:49:50,253 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 140 [2018-12-03 15:49:50,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:50,253 INFO L225 Difference]: With dead ends: 237 [2018-12-03 15:49:50,253 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 15:49:50,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 142 SyntacticMatches, 91 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12330 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=7798, Invalid=26612, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 15:49:50,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 15:49:50,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-12-03 15:49:50,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 15:49:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2018-12-03 15:49:50,298 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 140 [2018-12-03 15:49:50,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:50,298 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2018-12-03 15:49:50,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-12-03 15:49:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2018-12-03 15:49:50,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-03 15:49:50,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:50,299 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 1, 1, 1, 1] [2018-12-03 15:49:50,299 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:50,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:50,299 INFO L82 PathProgramCache]: Analyzing trace with hash 253169073, now seen corresponding path program 90 times [2018-12-03 15:49:50,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:50,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:50,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:50,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:50,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:51,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1081 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:51,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:51,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:51,299 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:51,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:51,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:51,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:51,308 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:51,308 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:51,422 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:51,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:51,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:51,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1081 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:51,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1081 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:53,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:53,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 51 [2018-12-03 15:49:53,125 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:53,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:49:53,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:49:53,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1230, Invalid=1422, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:49:53,126 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 52 states. [2018-12-03 15:49:54,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:54,491 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2018-12-03 15:49:54,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 15:49:54,491 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 141 [2018-12-03 15:49:54,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:54,492 INFO L225 Difference]: With dead ends: 150 [2018-12-03 15:49:54,492 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 15:49:54,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 233 SyntacticMatches, 92 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4464 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3628, Invalid=6074, Unknown=0, NotChecked=0, Total=9702 [2018-12-03 15:49:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 15:49:54,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2018-12-03 15:49:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-03 15:49:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2018-12-03 15:49:54,537 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 141 [2018-12-03 15:49:54,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:54,537 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2018-12-03 15:49:54,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:49:54,537 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2018-12-03 15:49:54,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-03 15:49:54,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:54,538 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1, 1, 1] [2018-12-03 15:49:54,538 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:54,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:54,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1517723507, now seen corresponding path program 91 times [2018-12-03 15:49:54,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:54,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:54,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:54,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:54,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:57,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 2162 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:57,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:57,318 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:57,318 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:57,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:57,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:57,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:57,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:57,328 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:57,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:01,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 2162 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:01,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:03,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 2162 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:03,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:03,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 142 [2018-12-03 15:50:03,622 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:03,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-12-03 15:50:03,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-12-03 15:50:03,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4654, Invalid=15652, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 15:50:03,623 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 143 states. [2018-12-03 15:50:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:07,310 INFO L93 Difference]: Finished difference Result 242 states and 244 transitions. [2018-12-03 15:50:07,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 15:50:07,310 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 143 [2018-12-03 15:50:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:07,311 INFO L225 Difference]: With dead ends: 242 [2018-12-03 15:50:07,311 INFO L226 Difference]: Without dead ends: 145 [2018-12-03 15:50:07,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 145 SyntacticMatches, 93 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12880 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=8132, Invalid=27778, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 15:50:07,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-03 15:50:07,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-12-03 15:50:07,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-03 15:50:07,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-12-03 15:50:07,356 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 143 [2018-12-03 15:50:07,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:07,356 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-12-03 15:50:07,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-12-03 15:50:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-12-03 15:50:07,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-03 15:50:07,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:07,357 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 46, 1, 1, 1, 1] [2018-12-03 15:50:07,357 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:07,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:07,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1392920458, now seen corresponding path program 92 times [2018-12-03 15:50:07,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:07,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:07,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:07,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:07,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:08,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 1128 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:08,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:08,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:08,402 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:08,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:08,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:08,402 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:08,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:08,410 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:08,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-03 15:50:08,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:08,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:08,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 1128 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:08,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:10,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 1128 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:10,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:10,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 52 [2018-12-03 15:50:10,670 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:10,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 15:50:10,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 15:50:10,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:50:10,671 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 53 states. [2018-12-03 15:50:11,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:11,835 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2018-12-03 15:50:11,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 15:50:11,835 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 144 [2018-12-03 15:50:11,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:11,836 INFO L225 Difference]: With dead ends: 153 [2018-12-03 15:50:11,837 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 15:50:11,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 238 SyntacticMatches, 94 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4655 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3777, Invalid=6323, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 15:50:11,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 15:50:11,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2018-12-03 15:50:11,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 15:50:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-12-03 15:50:11,884 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2018-12-03 15:50:11,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:11,885 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-12-03 15:50:11,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 15:50:11,885 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-12-03 15:50:11,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 15:50:11,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:11,886 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1, 1, 1] [2018-12-03 15:50:11,886 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:11,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:11,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1433169426, now seen corresponding path program 93 times [2018-12-03 15:50:11,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:11,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:11,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:11,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:11,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:15,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 2256 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:15,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:15,006 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:15,007 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:15,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:15,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:15,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:15,016 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:15,016 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:15,131 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:15,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:15,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:18,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 2256 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:18,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:21,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 2256 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:21,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:21,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 145 [2018-12-03 15:50:21,430 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:21,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-12-03 15:50:21,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-12-03 15:50:21,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4849, Invalid=16321, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 15:50:21,432 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 146 states. [2018-12-03 15:50:23,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:23,986 INFO L93 Difference]: Finished difference Result 247 states and 249 transitions. [2018-12-03 15:50:23,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 15:50:23,986 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 146 [2018-12-03 15:50:23,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:23,987 INFO L225 Difference]: With dead ends: 247 [2018-12-03 15:50:23,987 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 15:50:23,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 148 SyntacticMatches, 95 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13442 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=8473, Invalid=28969, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 15:50:23,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 15:50:24,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-12-03 15:50:24,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 15:50:24,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2018-12-03 15:50:24,035 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 146 [2018-12-03 15:50:24,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:24,035 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2018-12-03 15:50:24,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-12-03 15:50:24,035 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2018-12-03 15:50:24,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 15:50:24,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:24,036 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 1, 1, 1, 1] [2018-12-03 15:50:24,036 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:24,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:24,036 INFO L82 PathProgramCache]: Analyzing trace with hash -876151, now seen corresponding path program 94 times [2018-12-03 15:50:24,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:24,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:24,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:24,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:24,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:25,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1176 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:25,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:25,443 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:25,443 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:25,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:25,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:25,443 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:25,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:25,454 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:25,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:25,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1176 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:25,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1176 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:27,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:27,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 51] total 53 [2018-12-03 15:50:27,363 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:27,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 15:50:27,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 15:50:27,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:50:27,364 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 54 states. [2018-12-03 15:50:28,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:28,608 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2018-12-03 15:50:28,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 15:50:28,608 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 147 [2018-12-03 15:50:28,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:28,610 INFO L225 Difference]: With dead ends: 156 [2018-12-03 15:50:28,610 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 15:50:28,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 243 SyntacticMatches, 96 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4850 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3929, Invalid=6577, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 15:50:28,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 15:50:28,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2018-12-03 15:50:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-03 15:50:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-12-03 15:50:28,660 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 147 [2018-12-03 15:50:28,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:28,660 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-12-03 15:50:28,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 15:50:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-12-03 15:50:28,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-03 15:50:28,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:28,661 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1, 1, 1] [2018-12-03 15:50:28,661 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:28,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:28,662 INFO L82 PathProgramCache]: Analyzing trace with hash -842047899, now seen corresponding path program 95 times [2018-12-03 15:50:28,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:28,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:28,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:28,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:28,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:32,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 2352 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:32,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:32,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:32,302 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:32,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:32,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:32,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:32,315 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:32,315 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:32,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 15:50:32,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:32,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:36,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 2352 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:36,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:39,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 2352 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:39,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:39,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 148 [2018-12-03 15:50:39,092 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:39,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-12-03 15:50:39,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-12-03 15:50:39,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5048, Invalid=17004, Unknown=0, NotChecked=0, Total=22052 [2018-12-03 15:50:39,093 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 149 states. [2018-12-03 15:50:43,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:43,111 INFO L93 Difference]: Finished difference Result 252 states and 254 transitions. [2018-12-03 15:50:43,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 15:50:43,111 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 149 [2018-12-03 15:50:43,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:43,112 INFO L225 Difference]: With dead ends: 252 [2018-12-03 15:50:43,112 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 15:50:43,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 151 SyntacticMatches, 97 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14016 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=8821, Invalid=30185, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 15:50:43,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 15:50:43,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-12-03 15:50:43,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-03 15:50:43,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-12-03 15:50:43,168 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 149 [2018-12-03 15:50:43,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:43,168 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-12-03 15:50:43,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-12-03 15:50:43,168 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-12-03 15:50:43,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 15:50:43,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:43,169 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 48, 1, 1, 1, 1] [2018-12-03 15:50:43,170 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:43,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:43,170 INFO L82 PathProgramCache]: Analyzing trace with hash -454138994, now seen corresponding path program 96 times [2018-12-03 15:50:43,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:43,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:43,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:43,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:43,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:44,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 1225 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:44,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:44,292 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:44,292 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:44,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:44,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:44,292 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:44,302 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:44,302 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:44,427 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:44,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:44,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 1225 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:44,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 1225 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:46,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:46,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 54 [2018-12-03 15:50:46,542 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:46,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 15:50:46,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 15:50:46,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:50:46,543 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 55 states. [2018-12-03 15:50:47,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:47,833 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2018-12-03 15:50:47,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 15:50:47,833 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 150 [2018-12-03 15:50:47,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:47,834 INFO L225 Difference]: With dead ends: 159 [2018-12-03 15:50:47,834 INFO L226 Difference]: Without dead ends: 157 [2018-12-03 15:50:47,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 248 SyntacticMatches, 98 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5049 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4084, Invalid=6836, Unknown=0, NotChecked=0, Total=10920 [2018-12-03 15:50:47,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-03 15:50:47,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2018-12-03 15:50:47,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-03 15:50:47,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-12-03 15:50:47,887 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2018-12-03 15:50:47,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:47,888 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-12-03 15:50:47,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 15:50:47,888 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-12-03 15:50:47,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-03 15:50:47,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:47,888 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1, 1, 1] [2018-12-03 15:50:47,889 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:47,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:47,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1659024170, now seen corresponding path program 97 times [2018-12-03 15:50:47,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:47,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:47,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:47,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:47,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 2450 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:51,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:51,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:51,242 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:51,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:51,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:51,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:51,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:51,251 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:51,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 2450 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:55,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:58,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 2450 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:58,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:58,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 151 [2018-12-03 15:50:58,326 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:58,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-12-03 15:50:58,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-12-03 15:50:58,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5251, Invalid=17701, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 15:50:58,328 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 152 states. [2018-12-03 15:51:02,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:02,564 INFO L93 Difference]: Finished difference Result 257 states and 259 transitions. [2018-12-03 15:51:02,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 15:51:02,564 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 152 [2018-12-03 15:51:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:02,565 INFO L225 Difference]: With dead ends: 257 [2018-12-03 15:51:02,565 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 15:51:02,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 154 SyntacticMatches, 99 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14602 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=9176, Invalid=31426, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 15:51:02,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 15:51:02,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-12-03 15:51:02,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-03 15:51:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2018-12-03 15:51:02,618 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 152 [2018-12-03 15:51:02,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:02,618 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2018-12-03 15:51:02,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-12-03 15:51:02,618 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2018-12-03 15:51:02,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-03 15:51:02,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:02,619 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 1, 1, 1, 1] [2018-12-03 15:51:02,619 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:02,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:02,619 INFO L82 PathProgramCache]: Analyzing trace with hash 96219489, now seen corresponding path program 98 times [2018-12-03 15:51:02,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:02,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:02,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:02,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:02,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1275 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:03,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:03,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:03,988 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:03,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:03,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:03,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:03,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:51:03,996 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:51:04,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-03 15:51:04,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:04,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:04,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1275 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:04,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1275 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:06,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:06,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53, 53] total 55 [2018-12-03 15:51:06,424 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:06,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 15:51:06,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 15:51:06,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1436, Invalid=1644, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:51:06,425 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 56 states. [2018-12-03 15:51:07,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:07,768 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2018-12-03 15:51:07,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 15:51:07,768 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 153 [2018-12-03 15:51:07,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:07,769 INFO L225 Difference]: With dead ends: 162 [2018-12-03 15:51:07,769 INFO L226 Difference]: Without dead ends: 160 [2018-12-03 15:51:07,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 253 SyntacticMatches, 100 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5252 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4242, Invalid=7100, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 15:51:07,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-03 15:51:07,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2018-12-03 15:51:07,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 15:51:07,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 157 transitions. [2018-12-03 15:51:07,822 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 157 transitions. Word has length 153 [2018-12-03 15:51:07,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:07,822 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 157 transitions. [2018-12-03 15:51:07,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 15:51:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 157 transitions. [2018-12-03 15:51:07,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-03 15:51:07,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:07,823 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1, 1, 1] [2018-12-03 15:51:07,823 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:07,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:07,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2022418371, now seen corresponding path program 99 times [2018-12-03 15:51:07,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:07,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:07,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:07,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:07,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:11,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 2550 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:11,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:11,314 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:11,314 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:11,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:11,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:11,314 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:11,324 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:51:11,325 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:51:11,442 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:51:11,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:11,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:15,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 2550 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:15,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 2550 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:18,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:18,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 154 [2018-12-03 15:51:18,587 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:18,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-12-03 15:51:18,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-12-03 15:51:18,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5458, Invalid=18412, Unknown=0, NotChecked=0, Total=23870 [2018-12-03 15:51:18,589 INFO L87 Difference]: Start difference. First operand 156 states and 157 transitions. Second operand 155 states. [2018-12-03 15:51:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:22,942 INFO L93 Difference]: Finished difference Result 262 states and 264 transitions. [2018-12-03 15:51:22,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 15:51:22,942 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 155 [2018-12-03 15:51:22,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:22,943 INFO L225 Difference]: With dead ends: 262 [2018-12-03 15:51:22,943 INFO L226 Difference]: Without dead ends: 157 [2018-12-03 15:51:22,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 157 SyntacticMatches, 101 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15200 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=9538, Invalid=32692, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 15:51:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-03 15:51:22,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-12-03 15:51:22,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-03 15:51:22,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-12-03 15:51:22,999 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 155 [2018-12-03 15:51:22,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:22,999 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-12-03 15:51:22,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-12-03 15:51:22,999 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-12-03 15:51:22,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 15:51:22,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:23,000 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 1, 1, 1, 1] [2018-12-03 15:51:23,000 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:23,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:23,000 INFO L82 PathProgramCache]: Analyzing trace with hash -2091181402, now seen corresponding path program 100 times [2018-12-03 15:51:23,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:23,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:23,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:23,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:23,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:24,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1326 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:24,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:24,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:24,223 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:24,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:24,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:24,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:24,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:24,233 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:51:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:24,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1326 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:24,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:26,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1326 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:26,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:26,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 54] total 56 [2018-12-03 15:51:26,679 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:26,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 15:51:26,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 15:51:26,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=1702, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 15:51:26,680 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 57 states. [2018-12-03 15:51:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:28,035 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2018-12-03 15:51:28,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 15:51:28,035 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 156 [2018-12-03 15:51:28,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:28,037 INFO L225 Difference]: With dead ends: 165 [2018-12-03 15:51:28,037 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 15:51:28,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 258 SyntacticMatches, 102 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5459 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4403, Invalid=7369, Unknown=0, NotChecked=0, Total=11772 [2018-12-03 15:51:28,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 15:51:28,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-12-03 15:51:28,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-03 15:51:28,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-12-03 15:51:28,098 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2018-12-03 15:51:28,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:28,098 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-12-03 15:51:28,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 15:51:28,098 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-12-03 15:51:28,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-03 15:51:28,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:28,099 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1, 1, 1] [2018-12-03 15:51:28,099 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:28,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:28,099 INFO L82 PathProgramCache]: Analyzing trace with hash 419300418, now seen corresponding path program 101 times [2018-12-03 15:51:28,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:28,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:28,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:28,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:28,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 2652 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:31,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:31,726 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:31,726 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:31,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:31,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:31,726 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:31,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:51:31,734 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:51:31,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 15:51:31,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:31,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:35,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 2652 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:35,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:39,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 2652 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:39,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:39,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 157 [2018-12-03 15:51:39,399 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:39,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-12-03 15:51:39,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-12-03 15:51:39,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5669, Invalid=19137, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 15:51:39,401 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 158 states. [2018-12-03 15:51:43,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:43,912 INFO L93 Difference]: Finished difference Result 267 states and 269 transitions. [2018-12-03 15:51:43,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 15:51:43,913 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 158 [2018-12-03 15:51:43,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:43,914 INFO L225 Difference]: With dead ends: 267 [2018-12-03 15:51:43,914 INFO L226 Difference]: Without dead ends: 160 [2018-12-03 15:51:43,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 160 SyntacticMatches, 103 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15810 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=9907, Invalid=33983, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 15:51:43,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-03 15:51:43,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-12-03 15:51:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 15:51:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2018-12-03 15:51:43,972 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 158 [2018-12-03 15:51:43,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:43,973 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2018-12-03 15:51:43,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-12-03 15:51:43,973 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2018-12-03 15:51:43,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 15:51:43,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:43,974 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 1, 1, 1, 1] [2018-12-03 15:51:43,974 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:43,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:43,974 INFO L82 PathProgramCache]: Analyzing trace with hash 599244089, now seen corresponding path program 102 times [2018-12-03 15:51:43,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:43,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:43,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:43,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:43,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1378 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:45,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:45,266 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:45,267 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:45,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:45,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:45,267 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:45,275 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:51:45,275 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:51:45,408 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:51:45,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:45,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:45,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1378 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:45,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:47,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1378 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:47,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:47,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 55] total 57 [2018-12-03 15:51:47,836 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:47,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 15:51:47,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 15:51:47,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1545, Invalid=1761, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:51:47,837 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 58 states. [2018-12-03 15:51:49,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:49,255 INFO L93 Difference]: Finished difference Result 168 states and 169 transitions. [2018-12-03 15:51:49,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 15:51:49,255 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 159 [2018-12-03 15:51:49,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:49,256 INFO L225 Difference]: With dead ends: 168 [2018-12-03 15:51:49,256 INFO L226 Difference]: Without dead ends: 166 [2018-12-03 15:51:49,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 263 SyntacticMatches, 104 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5670 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4567, Invalid=7643, Unknown=0, NotChecked=0, Total=12210 [2018-12-03 15:51:49,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-03 15:51:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2018-12-03 15:51:49,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-03 15:51:49,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2018-12-03 15:51:49,324 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 159 [2018-12-03 15:51:49,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:49,324 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2018-12-03 15:51:49,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 15:51:49,324 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2018-12-03 15:51:49,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-03 15:51:49,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:49,325 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1, 1, 1] [2018-12-03 15:51:49,325 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:49,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:49,325 INFO L82 PathProgramCache]: Analyzing trace with hash 347885077, now seen corresponding path program 103 times [2018-12-03 15:51:49,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:49,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:49,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:49,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:49,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:53,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 2756 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:53,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:53,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:53,083 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:53,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:53,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:53,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:53,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:53,092 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:51:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:53,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 2756 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:57,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:00,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 2756 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:00,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:00,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 160 [2018-12-03 15:52:00,813 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:00,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-12-03 15:52:00,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-12-03 15:52:00,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5884, Invalid=19876, Unknown=0, NotChecked=0, Total=25760 [2018-12-03 15:52:00,815 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 161 states. [2018-12-03 15:52:05,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:05,590 INFO L93 Difference]: Finished difference Result 272 states and 274 transitions. [2018-12-03 15:52:05,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 15:52:05,590 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 161 [2018-12-03 15:52:05,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:05,591 INFO L225 Difference]: With dead ends: 272 [2018-12-03 15:52:05,591 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 15:52:05,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 163 SyntacticMatches, 105 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16432 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=10283, Invalid=35299, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 15:52:05,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 15:52:05,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-12-03 15:52:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-03 15:52:05,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-12-03 15:52:05,652 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 161 [2018-12-03 15:52:05,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:05,653 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-12-03 15:52:05,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-12-03 15:52:05,653 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-12-03 15:52:05,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 15:52:05,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:05,654 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 52, 1, 1, 1, 1] [2018-12-03 15:52:05,654 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:05,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:05,654 INFO L82 PathProgramCache]: Analyzing trace with hash 930602430, now seen corresponding path program 104 times [2018-12-03 15:52:05,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:05,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:05,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:05,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:05,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:06,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 1431 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:06,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:06,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:06,975 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:06,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:06,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:06,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:52:06,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:52:06,984 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:52:07,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-03 15:52:07,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:07,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:07,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 1431 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:07,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:09,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 1431 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:09,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:09,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 58 [2018-12-03 15:52:09,456 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:09,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 15:52:09,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 15:52:09,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:52:09,457 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 59 states. [2018-12-03 15:52:10,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:10,966 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2018-12-03 15:52:10,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 15:52:10,966 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 162 [2018-12-03 15:52:10,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:10,967 INFO L225 Difference]: With dead ends: 171 [2018-12-03 15:52:10,967 INFO L226 Difference]: Without dead ends: 169 [2018-12-03 15:52:10,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 268 SyntacticMatches, 106 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5885 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4734, Invalid=7922, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 15:52:10,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-03 15:52:11,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2018-12-03 15:52:11,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 15:52:11,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-12-03 15:52:11,027 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2018-12-03 15:52:11,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:11,027 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-12-03 15:52:11,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 15:52:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-12-03 15:52:11,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-03 15:52:11,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:11,028 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1, 1, 1] [2018-12-03 15:52:11,028 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:11,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:11,028 INFO L82 PathProgramCache]: Analyzing trace with hash 955670874, now seen corresponding path program 105 times [2018-12-03 15:52:11,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:11,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:11,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:11,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:11,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:14,817 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 2862 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:14,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:14,817 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:14,818 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:14,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:14,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:14,818 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:52:14,827 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:52:14,827 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:52:14,958 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:52:14,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:14,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 2862 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:19,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:23,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 2862 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:23,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:23,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 163 [2018-12-03 15:52:23,286 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:23,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-12-03 15:52:23,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-12-03 15:52:23,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6103, Invalid=20629, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 15:52:23,288 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 164 states. [2018-12-03 15:52:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:26,361 INFO L93 Difference]: Finished difference Result 277 states and 279 transitions. [2018-12-03 15:52:26,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 15:52:26,362 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 164 [2018-12-03 15:52:26,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:26,362 INFO L225 Difference]: With dead ends: 277 [2018-12-03 15:52:26,362 INFO L226 Difference]: Without dead ends: 166 [2018-12-03 15:52:26,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 166 SyntacticMatches, 107 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17066 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=10666, Invalid=36640, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 15:52:26,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-03 15:52:26,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-12-03 15:52:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-03 15:52:26,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2018-12-03 15:52:26,452 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 164 [2018-12-03 15:52:26,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:26,453 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2018-12-03 15:52:26,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-12-03 15:52:26,453 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2018-12-03 15:52:26,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-03 15:52:26,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:26,453 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 1, 1, 1, 1] [2018-12-03 15:52:26,454 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:26,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:26,454 INFO L82 PathProgramCache]: Analyzing trace with hash 430523665, now seen corresponding path program 106 times [2018-12-03 15:52:26,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:26,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:26,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:26,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:26,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:28,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1485 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:28,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:28,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:28,112 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:28,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:28,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:28,112 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:28,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:28,120 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:52:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:28,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1485 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:28,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1485 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:30,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:30,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 57, 57] total 59 [2018-12-03 15:52:30,426 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:30,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 15:52:30,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 15:52:30,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1658, Invalid=1882, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:52:30,427 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 60 states. [2018-12-03 15:52:31,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:31,893 INFO L93 Difference]: Finished difference Result 174 states and 175 transitions. [2018-12-03 15:52:31,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-12-03 15:52:31,893 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 165 [2018-12-03 15:52:31,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:31,894 INFO L225 Difference]: With dead ends: 174 [2018-12-03 15:52:31,894 INFO L226 Difference]: Without dead ends: 172 [2018-12-03 15:52:31,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 273 SyntacticMatches, 108 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6104 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4904, Invalid=8206, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 15:52:31,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-03 15:52:31,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2018-12-03 15:52:31,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-03 15:52:31,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2018-12-03 15:52:31,958 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 165 [2018-12-03 15:52:31,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:31,959 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2018-12-03 15:52:31,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 15:52:31,959 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2018-12-03 15:52:31,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-03 15:52:31,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:31,959 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1, 1, 1] [2018-12-03 15:52:31,960 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:31,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:31,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1416314861, now seen corresponding path program 107 times [2018-12-03 15:52:31,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:31,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:31,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:31,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:31,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:35,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 2970 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:35,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:35,880 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:35,880 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:35,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:35,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:35,881 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:35,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:52:35,888 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:52:36,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-03 15:52:36,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:36,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:40,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 2970 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:40,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:44,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 2970 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:44,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:44,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 166 [2018-12-03 15:52:44,664 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:44,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-12-03 15:52:44,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-12-03 15:52:44,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6326, Invalid=21396, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 15:52:44,666 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 167 states. [2018-12-03 15:52:49,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:49,567 INFO L93 Difference]: Finished difference Result 282 states and 284 transitions. [2018-12-03 15:52:49,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 15:52:49,567 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 167 [2018-12-03 15:52:49,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:49,567 INFO L225 Difference]: With dead ends: 282 [2018-12-03 15:52:49,567 INFO L226 Difference]: Without dead ends: 169 [2018-12-03 15:52:49,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 169 SyntacticMatches, 109 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17712 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=11056, Invalid=38006, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 15:52:49,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-03 15:52:49,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-12-03 15:52:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-03 15:52:49,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-12-03 15:52:49,628 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 167 [2018-12-03 15:52:49,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:49,628 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-12-03 15:52:49,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-12-03 15:52:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-12-03 15:52:49,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-03 15:52:49,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:49,629 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 54, 1, 1, 1, 1] [2018-12-03 15:52:49,629 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:49,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:49,630 INFO L82 PathProgramCache]: Analyzing trace with hash -973296426, now seen corresponding path program 108 times [2018-12-03 15:52:49,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:49,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:49,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:49,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:49,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 1540 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:51,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:51,085 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:51,085 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:51,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:51,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:51,085 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:51,094 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:52:51,094 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:52:51,230 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:52:51,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:51,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 1540 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:51,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 1540 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:53,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:53,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 60 [2018-12-03 15:52:53,802 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:53,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 15:52:53,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 15:52:53,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1716, Invalid=1944, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:52:53,803 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 61 states. [2018-12-03 15:52:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:55,453 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2018-12-03 15:52:55,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-12-03 15:52:55,454 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 168 [2018-12-03 15:52:55,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:55,454 INFO L225 Difference]: With dead ends: 177 [2018-12-03 15:52:55,454 INFO L226 Difference]: Without dead ends: 175 [2018-12-03 15:52:55,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 278 SyntacticMatches, 110 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6327 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5077, Invalid=8495, Unknown=0, NotChecked=0, Total=13572 [2018-12-03 15:52:55,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-03 15:52:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2018-12-03 15:52:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-03 15:52:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-12-03 15:52:55,532 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2018-12-03 15:52:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:55,532 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-12-03 15:52:55,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 15:52:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-12-03 15:52:55,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-03 15:52:55,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:55,532 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 55, 1, 1, 1, 1] [2018-12-03 15:52:55,533 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:55,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:55,533 INFO L82 PathProgramCache]: Analyzing trace with hash 964938354, now seen corresponding path program 109 times [2018-12-03 15:52:55,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:55,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:55,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:55,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:55,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:59,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 3080 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:59,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:59,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:59,623 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:59,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:59,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:59,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:59,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:59,632 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:52:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:59,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:04,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 3080 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:04,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 3080 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:08,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:08,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113, 113] total 169 [2018-12-03 15:53:08,464 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:08,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-12-03 15:53:08,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-12-03 15:53:08,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6553, Invalid=22177, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 15:53:08,465 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 170 states. [2018-12-03 15:53:13,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:13,534 INFO L93 Difference]: Finished difference Result 287 states and 289 transitions. [2018-12-03 15:53:13,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-12-03 15:53:13,535 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 170 [2018-12-03 15:53:13,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:13,535 INFO L225 Difference]: With dead ends: 287 [2018-12-03 15:53:13,535 INFO L226 Difference]: Without dead ends: 172 [2018-12-03 15:53:13,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 172 SyntacticMatches, 111 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18370 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=11453, Invalid=39397, Unknown=0, NotChecked=0, Total=50850 [2018-12-03 15:53:13,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-03 15:53:13,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-12-03 15:53:13,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 15:53:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2018-12-03 15:53:13,602 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 170 [2018-12-03 15:53:13,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:13,602 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2018-12-03 15:53:13,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-12-03 15:53:13,602 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2018-12-03 15:53:13,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-03 15:53:13,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:13,603 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 1, 1, 1, 1] [2018-12-03 15:53:13,603 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:13,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:13,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1138018537, now seen corresponding path program 110 times [2018-12-03 15:53:13,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:13,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:13,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:13,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:13,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:15,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 1596 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:15,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:15,174 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:15,174 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:15,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:15,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:15,175 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:15,183 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:15,183 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:15,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 15:53:15,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:15,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 1596 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:15,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:17,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 1596 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:17,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:17,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59, 59] total 61 [2018-12-03 15:53:17,919 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:17,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 15:53:17,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 15:53:17,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1775, Invalid=2007, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:53:17,920 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand 62 states. [2018-12-03 15:53:19,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:19,789 INFO L93 Difference]: Finished difference Result 180 states and 181 transitions. [2018-12-03 15:53:19,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-12-03 15:53:19,789 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 171 [2018-12-03 15:53:19,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:19,790 INFO L225 Difference]: With dead ends: 180 [2018-12-03 15:53:19,790 INFO L226 Difference]: Without dead ends: 178 [2018-12-03 15:53:19,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 283 SyntacticMatches, 112 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6554 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5253, Invalid=8789, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 15:53:19,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-03 15:53:19,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2018-12-03 15:53:19,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-03 15:53:19,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 175 transitions. [2018-12-03 15:53:19,878 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 175 transitions. Word has length 171 [2018-12-03 15:53:19,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:19,879 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 175 transitions. [2018-12-03 15:53:19,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 15:53:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 175 transitions. [2018-12-03 15:53:19,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-03 15:53:19,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:19,879 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 56, 1, 1, 1, 1] [2018-12-03 15:53:19,879 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:19,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:19,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1580913211, now seen corresponding path program 111 times [2018-12-03 15:53:19,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:19,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:19,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:19,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:19,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:24,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 3192 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:24,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:24,059 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:24,059 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:24,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:24,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:24,059 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:24,067 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:24,067 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:24,210 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:24,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:24,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:29,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 3192 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:29,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 3192 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:33,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:33,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115, 115] total 172 [2018-12-03 15:53:33,095 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:33,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-12-03 15:53:33,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-12-03 15:53:33,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6784, Invalid=22972, Unknown=0, NotChecked=0, Total=29756 [2018-12-03 15:53:33,097 INFO L87 Difference]: Start difference. First operand 174 states and 175 transitions. Second operand 173 states. [2018-12-03 15:53:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:38,337 INFO L93 Difference]: Finished difference Result 292 states and 294 transitions. [2018-12-03 15:53:38,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-12-03 15:53:38,337 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 173 [2018-12-03 15:53:38,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:38,338 INFO L225 Difference]: With dead ends: 292 [2018-12-03 15:53:38,338 INFO L226 Difference]: Without dead ends: 175 [2018-12-03 15:53:38,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 175 SyntacticMatches, 113 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19040 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=11857, Invalid=40813, Unknown=0, NotChecked=0, Total=52670 [2018-12-03 15:53:38,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-03 15:53:38,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-12-03 15:53:38,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 15:53:38,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-12-03 15:53:38,405 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 173 [2018-12-03 15:53:38,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:38,406 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-12-03 15:53:38,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-12-03 15:53:38,406 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-12-03 15:53:38,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-03 15:53:38,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:38,406 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 56, 1, 1, 1, 1] [2018-12-03 15:53:38,407 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:38,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:38,407 INFO L82 PathProgramCache]: Analyzing trace with hash 690063342, now seen corresponding path program 112 times [2018-12-03 15:53:38,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:38,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:38,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:38,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:38,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:40,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 1653 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:40,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:40,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:40,212 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:40,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:40,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:40,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:40,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:40,220 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:40,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:40,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 1653 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:40,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:42,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 1653 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:42,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:42,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 62 [2018-12-03 15:53:42,872 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:42,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 15:53:42,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 15:53:42,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1835, Invalid=2071, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 15:53:42,873 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 63 states. [2018-12-03 15:53:44,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:44,767 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2018-12-03 15:53:44,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-12-03 15:53:44,767 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 174 [2018-12-03 15:53:44,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:44,768 INFO L225 Difference]: With dead ends: 183 [2018-12-03 15:53:44,768 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 15:53:44,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 288 SyntacticMatches, 114 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6785 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5432, Invalid=9088, Unknown=0, NotChecked=0, Total=14520 [2018-12-03 15:53:44,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 15:53:44,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2018-12-03 15:53:44,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 15:53:44,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-12-03 15:53:44,839 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2018-12-03 15:53:44,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:44,839 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-12-03 15:53:44,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 15:53:44,839 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-12-03 15:53:44,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-03 15:53:44,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:44,840 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 57, 1, 1, 1, 1] [2018-12-03 15:53:44,840 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:44,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:44,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1725841290, now seen corresponding path program 113 times [2018-12-03 15:53:44,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:44,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:44,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:44,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:44,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:48,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 3306 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:48,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:48,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:48,950 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:48,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:48,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:48,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:48,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:48,961 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:49,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-12-03 15:53:49,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:49,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 3306 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:54,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 3306 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:58,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:58,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117, 117] total 175 [2018-12-03 15:53:58,681 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:58,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-12-03 15:53:58,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-12-03 15:53:58,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7019, Invalid=23781, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 15:53:58,683 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 176 states. [2018-12-03 15:54:04,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:04,176 INFO L93 Difference]: Finished difference Result 297 states and 299 transitions. [2018-12-03 15:54:04,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-12-03 15:54:04,177 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 176 [2018-12-03 15:54:04,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:04,177 INFO L225 Difference]: With dead ends: 297 [2018-12-03 15:54:04,177 INFO L226 Difference]: Without dead ends: 178 [2018-12-03 15:54:04,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 178 SyntacticMatches, 115 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19722 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=12268, Invalid=42254, Unknown=0, NotChecked=0, Total=54522 [2018-12-03 15:54:04,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-03 15:54:04,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-12-03 15:54:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-03 15:54:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2018-12-03 15:54:04,247 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 176 [2018-12-03 15:54:04,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:04,247 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2018-12-03 15:54:04,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-12-03 15:54:04,247 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2018-12-03 15:54:04,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-03 15:54:04,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:04,248 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 1, 1, 1, 1] [2018-12-03 15:54:04,248 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:04,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:04,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2063485121, now seen corresponding path program 114 times [2018-12-03 15:54:04,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:04,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:04,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:04,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:04,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 1711 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:05,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:05,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:05,990 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:05,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:05,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:05,990 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:05,999 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:06,000 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:06,145 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:06,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:06,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:06,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 1711 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:06,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 1711 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:08,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:08,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61, 61] total 63 [2018-12-03 15:54:08,734 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:08,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 15:54:08,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 15:54:08,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1896, Invalid=2136, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:54:08,734 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand 64 states. [2018-12-03 15:54:10,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:10,661 INFO L93 Difference]: Finished difference Result 186 states and 187 transitions. [2018-12-03 15:54:10,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-12-03 15:54:10,661 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 177 [2018-12-03 15:54:10,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:10,662 INFO L225 Difference]: With dead ends: 186 [2018-12-03 15:54:10,662 INFO L226 Difference]: Without dead ends: 184 [2018-12-03 15:54:10,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 293 SyntacticMatches, 116 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7020 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5614, Invalid=9392, Unknown=0, NotChecked=0, Total=15006 [2018-12-03 15:54:10,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-03 15:54:10,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2018-12-03 15:54:10,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-03 15:54:10,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2018-12-03 15:54:10,734 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 177 [2018-12-03 15:54:10,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:10,734 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2018-12-03 15:54:10,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 15:54:10,734 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2018-12-03 15:54:10,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-03 15:54:10,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:10,734 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 58, 1, 1, 1, 1] [2018-12-03 15:54:10,735 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:10,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:10,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1265756259, now seen corresponding path program 115 times [2018-12-03 15:54:10,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:10,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:10,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:10,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:10,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 3422 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:14,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:14,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:14,967 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:14,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:14,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:14,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:14,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:14,979 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:15,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 3422 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:20,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:24,744 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 3422 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:24,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:24,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119, 119] total 178 [2018-12-03 15:54:24,763 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:24,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-12-03 15:54:24,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-12-03 15:54:24,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7258, Invalid=24604, Unknown=0, NotChecked=0, Total=31862 [2018-12-03 15:54:24,765 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 179 states. [2018-12-03 15:54:30,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:30,638 INFO L93 Difference]: Finished difference Result 302 states and 304 transitions. [2018-12-03 15:54:30,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-12-03 15:54:30,638 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 179 [2018-12-03 15:54:30,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:30,639 INFO L225 Difference]: With dead ends: 302 [2018-12-03 15:54:30,639 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 15:54:30,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 181 SyntacticMatches, 117 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20416 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=12686, Invalid=43720, Unknown=0, NotChecked=0, Total=56406 [2018-12-03 15:54:30,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 15:54:30,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-12-03 15:54:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-03 15:54:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-12-03 15:54:30,711 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 179 [2018-12-03 15:54:30,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:30,711 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-12-03 15:54:30,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-12-03 15:54:30,711 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-12-03 15:54:30,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-03 15:54:30,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:30,712 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 58, 1, 1, 1, 1] [2018-12-03 15:54:30,712 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:30,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:30,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1331794170, now seen corresponding path program 116 times [2018-12-03 15:54:30,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:30,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:30,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:30,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:30,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 1770 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:32,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:32,314 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:32,314 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:32,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:32,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:32,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:32,323 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:32,324 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:32,649 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 59 check-sat command(s) [2018-12-03 15:54:32,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:32,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 1770 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:32,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 1770 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:35,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:35,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 64 [2018-12-03 15:54:35,342 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:35,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 15:54:35,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 15:54:35,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 15:54:35,344 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 65 states. [2018-12-03 15:54:37,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:37,324 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2018-12-03 15:54:37,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-12-03 15:54:37,324 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 180 [2018-12-03 15:54:37,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:37,325 INFO L225 Difference]: With dead ends: 189 [2018-12-03 15:54:37,325 INFO L226 Difference]: Without dead ends: 187 [2018-12-03 15:54:37,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 298 SyntacticMatches, 118 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7259 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5799, Invalid=9701, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 15:54:37,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-03 15:54:37,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-12-03 15:54:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-03 15:54:37,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-12-03 15:54:37,401 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2018-12-03 15:54:37,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:37,401 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-12-03 15:54:37,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 15:54:37,401 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-12-03 15:54:37,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-03 15:54:37,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:37,402 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 59, 1, 1, 1, 1] [2018-12-03 15:54:37,402 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:37,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:37,402 INFO L82 PathProgramCache]: Analyzing trace with hash 45990050, now seen corresponding path program 117 times [2018-12-03 15:54:37,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:37,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:37,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:37,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:37,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 3540 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:42,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:42,073 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:42,073 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:42,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:42,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:42,073 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:42,081 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:42,081 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:42,229 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:42,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:42,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:47,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 3540 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:47,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 3540 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:52,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:52,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121, 121] total 181 [2018-12-03 15:54:52,307 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:52,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-12-03 15:54:52,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-12-03 15:54:52,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7501, Invalid=25441, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 15:54:52,309 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 182 states. [2018-12-03 15:54:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:57,578 INFO L93 Difference]: Finished difference Result 307 states and 309 transitions. [2018-12-03 15:54:57,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-12-03 15:54:57,578 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 182 [2018-12-03 15:54:57,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:57,578 INFO L225 Difference]: With dead ends: 307 [2018-12-03 15:54:57,578 INFO L226 Difference]: Without dead ends: 184 [2018-12-03 15:54:57,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 184 SyntacticMatches, 119 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21122 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=13111, Invalid=45211, Unknown=0, NotChecked=0, Total=58322 [2018-12-03 15:54:57,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-03 15:54:57,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-12-03 15:54:57,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-03 15:54:57,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2018-12-03 15:54:57,653 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 182 [2018-12-03 15:54:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:57,653 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2018-12-03 15:54:57,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-12-03 15:54:57,653 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2018-12-03 15:54:57,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-03 15:54:57,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:57,653 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 59, 1, 1, 1, 1] [2018-12-03 15:54:57,654 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:57,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:57,654 INFO L82 PathProgramCache]: Analyzing trace with hash -194394983, now seen corresponding path program 118 times [2018-12-03 15:54:57,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:57,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:57,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:57,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:57,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 1830 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:59,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:59,311 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:59,311 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:59,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:59,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:59,311 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:59,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:59,322 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:59,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:59,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 1830 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:59,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 1830 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:02,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:02,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 63, 63] total 65 [2018-12-03 15:55:02,401 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:02,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 15:55:02,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 15:55:02,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2021, Invalid=2269, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:55:02,402 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 66 states. [2018-12-03 15:55:04,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:04,205 INFO L93 Difference]: Finished difference Result 192 states and 193 transitions. [2018-12-03 15:55:04,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-12-03 15:55:04,205 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 183 [2018-12-03 15:55:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:04,206 INFO L225 Difference]: With dead ends: 192 [2018-12-03 15:55:04,206 INFO L226 Difference]: Without dead ends: 190 [2018-12-03 15:55:04,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 303 SyntacticMatches, 120 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7502 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5987, Invalid=10015, Unknown=0, NotChecked=0, Total=16002 [2018-12-03 15:55:04,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-03 15:55:04,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 186. [2018-12-03 15:55:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-03 15:55:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2018-12-03 15:55:04,302 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 183 [2018-12-03 15:55:04,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:04,302 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 187 transitions. [2018-12-03 15:55:04,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 15:55:04,303 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 187 transitions. [2018-12-03 15:55:04,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-03 15:55:04,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:04,303 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 60, 1, 1, 1, 1] [2018-12-03 15:55:04,303 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:04,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:04,304 INFO L82 PathProgramCache]: Analyzing trace with hash -2130051723, now seen corresponding path program 119 times [2018-12-03 15:55:04,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:04,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:04,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:04,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:04,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:09,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5490 backedges. 3660 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:09,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:09,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:09,065 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:09,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:09,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:09,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:09,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:09,074 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:09,403 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 61 check-sat command(s) [2018-12-03 15:55:09,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:09,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:15,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5490 backedges. 3660 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:15,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:19,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5490 backedges. 3660 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:19,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:19,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 123, 123] total 184 [2018-12-03 15:55:19,870 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:19,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 185 states [2018-12-03 15:55:19,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2018-12-03 15:55:19,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7748, Invalid=26292, Unknown=0, NotChecked=0, Total=34040 [2018-12-03 15:55:19,872 INFO L87 Difference]: Start difference. First operand 186 states and 187 transitions. Second operand 185 states. [2018-12-03 15:55:25,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:25,945 INFO L93 Difference]: Finished difference Result 312 states and 314 transitions. [2018-12-03 15:55:25,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-12-03 15:55:25,946 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 185 [2018-12-03 15:55:25,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:25,946 INFO L225 Difference]: With dead ends: 312 [2018-12-03 15:55:25,946 INFO L226 Difference]: Without dead ends: 187 [2018-12-03 15:55:25,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 187 SyntacticMatches, 121 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21840 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=13543, Invalid=46727, Unknown=0, NotChecked=0, Total=60270 [2018-12-03 15:55:25,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-03 15:55:26,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-12-03 15:55:26,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-03 15:55:26,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-12-03 15:55:26,036 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 185 [2018-12-03 15:55:26,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:26,036 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-12-03 15:55:26,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 185 states. [2018-12-03 15:55:26,037 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-12-03 15:55:26,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-03 15:55:26,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:26,037 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 60, 1, 1, 1, 1] [2018-12-03 15:55:26,037 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:26,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:26,038 INFO L82 PathProgramCache]: Analyzing trace with hash 564879902, now seen corresponding path program 120 times [2018-12-03 15:55:26,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:26,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:26,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:26,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:26,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 1891 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:27,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:27,969 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:27,970 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:27,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:27,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:27,970 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:27,978 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:27,978 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:28,131 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:28,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:28,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 1891 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:28,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:30,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 1891 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:30,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:30,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 64, 64] total 66 [2018-12-03 15:55:30,896 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:30,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 15:55:30,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 15:55:30,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2085, Invalid=2337, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 15:55:30,897 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 67 states. [2018-12-03 15:55:33,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:33,034 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2018-12-03 15:55:33,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-12-03 15:55:33,034 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 186 [2018-12-03 15:55:33,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:33,035 INFO L225 Difference]: With dead ends: 195 [2018-12-03 15:55:33,035 INFO L226 Difference]: Without dead ends: 193 [2018-12-03 15:55:33,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 308 SyntacticMatches, 122 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7749 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=6178, Invalid=10334, Unknown=0, NotChecked=0, Total=16512 [2018-12-03 15:55:33,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-03 15:55:33,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2018-12-03 15:55:33,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-03 15:55:33,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-12-03 15:55:33,115 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2018-12-03 15:55:33,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:33,115 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-12-03 15:55:33,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 15:55:33,115 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-12-03 15:55:33,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-03 15:55:33,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:33,116 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 61, 1, 1, 1, 1] [2018-12-03 15:55:33,116 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:33,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:33,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1683639738, now seen corresponding path program 121 times [2018-12-03 15:55:33,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:33,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:33,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:33,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:33,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 3782 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:38,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:38,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:38,101 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:38,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:38,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:38,101 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:38,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:38,110 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:38,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:44,263 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 3782 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:44,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:48,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 3782 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:48,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:48,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125, 125, 125] total 187 [2018-12-03 15:55:48,969 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:48,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-12-03 15:55:48,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-12-03 15:55:48,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7999, Invalid=27157, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 15:55:48,972 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 188 states. [2018-12-03 15:55:55,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:55,534 INFO L93 Difference]: Finished difference Result 317 states and 319 transitions. [2018-12-03 15:55:55,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-12-03 15:55:55,534 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 188 [2018-12-03 15:55:55,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:55,535 INFO L225 Difference]: With dead ends: 317 [2018-12-03 15:55:55,535 INFO L226 Difference]: Without dead ends: 190 [2018-12-03 15:55:55,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 190 SyntacticMatches, 123 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22570 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=13982, Invalid=48268, Unknown=0, NotChecked=0, Total=62250 [2018-12-03 15:55:55,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-03 15:55:55,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-12-03 15:55:55,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-03 15:55:55,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2018-12-03 15:55:55,614 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 188 [2018-12-03 15:55:55,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:55,614 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2018-12-03 15:55:55,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-12-03 15:55:55,614 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2018-12-03 15:55:55,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-03 15:55:55,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:55,615 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 61, 1, 1, 1, 1] [2018-12-03 15:55:55,615 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:55,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:55,616 INFO L82 PathProgramCache]: Analyzing trace with hash 568015985, now seen corresponding path program 122 times [2018-12-03 15:55:55,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:55,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:55,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:55,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:55,617 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:57,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 1953 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:57,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:57,371 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:57,372 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:57,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:57,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:57,372 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:57,380 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:57,380 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:57,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 62 check-sat command(s) [2018-12-03 15:55:57,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:57,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:57,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 1953 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:57,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 1953 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:00,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:00,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65, 65] total 67 [2018-12-03 15:56:00,708 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:00,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 15:56:00,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 15:56:00,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2150, Invalid=2406, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 15:56:00,709 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 68 states. [2018-12-03 15:56:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:02,945 INFO L93 Difference]: Finished difference Result 198 states and 199 transitions. [2018-12-03 15:56:02,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-12-03 15:56:02,946 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 189 [2018-12-03 15:56:02,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:02,946 INFO L225 Difference]: With dead ends: 198 [2018-12-03 15:56:02,946 INFO L226 Difference]: Without dead ends: 196 [2018-12-03 15:56:02,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 313 SyntacticMatches, 124 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8000 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=6372, Invalid=10658, Unknown=0, NotChecked=0, Total=17030 [2018-12-03 15:56:02,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-03 15:56:03,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 192. [2018-12-03 15:56:03,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-12-03 15:56:03,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 193 transitions. [2018-12-03 15:56:03,033 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 193 transitions. Word has length 189 [2018-12-03 15:56:03,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:03,033 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 193 transitions. [2018-12-03 15:56:03,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 15:56:03,033 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 193 transitions. [2018-12-03 15:56:03,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-03 15:56:03,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:03,034 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 62, 1, 1, 1, 1] [2018-12-03 15:56:03,034 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:03,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:03,035 INFO L82 PathProgramCache]: Analyzing trace with hash 402448205, now seen corresponding path program 123 times [2018-12-03 15:56:03,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:03,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:03,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:03,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:03,036 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:08,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5859 backedges. 3906 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:08,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:08,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:08,199 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:08,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:08,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:08,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:08,208 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:08,208 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:08,366 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:08,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:08,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:14,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5859 backedges. 3906 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:14,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5859 backedges. 3906 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:19,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:19,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127, 127] total 190 [2018-12-03 15:56:19,378 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:19,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 191 states [2018-12-03 15:56:19,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2018-12-03 15:56:19,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8254, Invalid=28036, Unknown=0, NotChecked=0, Total=36290 [2018-12-03 15:56:19,380 INFO L87 Difference]: Start difference. First operand 192 states and 193 transitions. Second operand 191 states. [2018-12-03 15:56:25,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:25,901 INFO L93 Difference]: Finished difference Result 322 states and 324 transitions. [2018-12-03 15:56:25,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-12-03 15:56:25,901 INFO L78 Accepts]: Start accepts. Automaton has 191 states. Word has length 191 [2018-12-03 15:56:25,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:25,901 INFO L225 Difference]: With dead ends: 322 [2018-12-03 15:56:25,901 INFO L226 Difference]: Without dead ends: 193 [2018-12-03 15:56:25,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 193 SyntacticMatches, 125 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23312 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=14428, Invalid=49834, Unknown=0, NotChecked=0, Total=64262 [2018-12-03 15:56:25,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-03 15:56:25,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-12-03 15:56:25,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-12-03 15:56:25,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-12-03 15:56:25,985 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 191 [2018-12-03 15:56:25,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:25,985 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-12-03 15:56:25,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 191 states. [2018-12-03 15:56:25,985 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-12-03 15:56:25,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-03 15:56:25,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:25,986 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 62, 1, 1, 1, 1] [2018-12-03 15:56:25,986 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:25,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:25,986 INFO L82 PathProgramCache]: Analyzing trace with hash -687840970, now seen corresponding path program 124 times [2018-12-03 15:56:25,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:25,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:25,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:25,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:25,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 2016 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:27,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:27,776 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:27,776 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:27,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:27,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:27,777 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:27,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:27,785 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:27,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 2016 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:28,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 2016 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:31,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:31,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 68 [2018-12-03 15:56:31,313 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:31,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 15:56:31,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 15:56:31,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2216, Invalid=2476, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 15:56:31,314 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 69 states. [2018-12-03 15:56:33,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:33,326 INFO L93 Difference]: Finished difference Result 201 states and 202 transitions. [2018-12-03 15:56:33,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-12-03 15:56:33,326 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 192 [2018-12-03 15:56:33,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:33,327 INFO L225 Difference]: With dead ends: 201 [2018-12-03 15:56:33,327 INFO L226 Difference]: Without dead ends: 199 [2018-12-03 15:56:33,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 318 SyntacticMatches, 126 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8255 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=6569, Invalid=10987, Unknown=0, NotChecked=0, Total=17556 [2018-12-03 15:56:33,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-12-03 15:56:33,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 195. [2018-12-03 15:56:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-03 15:56:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-12-03 15:56:33,411 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2018-12-03 15:56:33,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:33,411 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-12-03 15:56:33,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 15:56:33,411 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-12-03 15:56:33,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-03 15:56:33,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:33,412 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 63, 1, 1, 1, 1] [2018-12-03 15:56:33,413 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:33,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:33,413 INFO L82 PathProgramCache]: Analyzing trace with hash 409724626, now seen corresponding path program 125 times [2018-12-03 15:56:33,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:33,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:33,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:33,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:33,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:38,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6048 backedges. 4032 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:38,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:38,701 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:38,701 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:38,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:38,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:38,701 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:38,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:38,710 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:39,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-12-03 15:56:39,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:39,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6048 backedges. 4032 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:45,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:50,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6048 backedges. 4032 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:50,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:50,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129, 129] total 193 [2018-12-03 15:56:50,508 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:50,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-12-03 15:56:50,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-12-03 15:56:50,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8513, Invalid=28929, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 15:56:50,510 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 194 states. [2018-12-03 15:56:57,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:57,419 INFO L93 Difference]: Finished difference Result 327 states and 329 transitions. [2018-12-03 15:56:57,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-12-03 15:56:57,419 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 194 [2018-12-03 15:56:57,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:57,419 INFO L225 Difference]: With dead ends: 327 [2018-12-03 15:56:57,420 INFO L226 Difference]: Without dead ends: 196 [2018-12-03 15:56:57,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 196 SyntacticMatches, 127 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24066 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=14881, Invalid=51425, Unknown=0, NotChecked=0, Total=66306 [2018-12-03 15:56:57,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-03 15:56:57,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-12-03 15:56:57,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 15:56:57,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 197 transitions. [2018-12-03 15:56:57,513 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 197 transitions. Word has length 194 [2018-12-03 15:56:57,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:57,513 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 197 transitions. [2018-12-03 15:56:57,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-12-03 15:56:57,513 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 197 transitions. [2018-12-03 15:56:57,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-03 15:56:57,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:57,514 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 63, 1, 1, 1, 1] [2018-12-03 15:56:57,514 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:57,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:57,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1852395447, now seen corresponding path program 126 times [2018-12-03 15:56:57,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:57,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:57,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:57,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:57,516 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:59,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 2080 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:59,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:59,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:59,592 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:59,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:59,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:59,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:59,602 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:59,602 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:59,770 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:59,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:59,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:59,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 2080 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:59,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 2016 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:03,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:03,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 72 [2018-12-03 15:57:03,063 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:03,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 15:57:03,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 15:57:03,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2363, Invalid=2893, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 15:57:03,065 INFO L87 Difference]: Start difference. First operand 196 states and 197 transitions. Second operand 71 states. [2018-12-03 15:57:05,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:05,620 INFO L93 Difference]: Finished difference Result 204 states and 205 transitions. [2018-12-03 15:57:05,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-12-03 15:57:05,620 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 195 [2018-12-03 15:57:05,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:05,621 INFO L225 Difference]: With dead ends: 204 [2018-12-03 15:57:05,621 INFO L226 Difference]: Without dead ends: 202 [2018-12-03 15:57:05,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 321 SyntacticMatches, 127 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8779 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=6779, Invalid=11853, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 15:57:05,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-03 15:57:05,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 198. [2018-12-03 15:57:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-12-03 15:57:05,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 199 transitions. [2018-12-03 15:57:05,718 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 199 transitions. Word has length 195 [2018-12-03 15:57:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:05,719 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 199 transitions. [2018-12-03 15:57:05,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 15:57:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 199 transitions. [2018-12-03 15:57:05,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-03 15:57:05,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:05,720 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 64, 1, 1, 1, 1] [2018-12-03 15:57:05,720 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:05,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:05,720 INFO L82 PathProgramCache]: Analyzing trace with hash -2035630811, now seen corresponding path program 127 times [2018-12-03 15:57:05,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:05,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:05,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:05,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:05,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat