java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 19:25:22,376 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 19:25:22,379 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 19:25:22,393 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 19:25:22,394 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 19:25:22,395 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 19:25:22,396 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 19:25:22,398 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 19:25:22,399 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 19:25:22,400 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 19:25:22,401 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 19:25:22,402 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 19:25:22,402 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 19:25:22,404 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 19:25:22,405 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 19:25:22,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 19:25:22,406 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 19:25:22,409 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 19:25:22,415 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 19:25:22,419 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 19:25:22,424 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 19:25:22,425 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 19:25:22,428 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 19:25:22,428 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 19:25:22,428 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 19:25:22,435 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 19:25:22,436 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 19:25:22,436 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 19:25:22,437 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 19:25:22,438 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 19:25:22,438 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 19:25:22,442 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 19:25:22,442 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 19:25:22,443 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 19:25:22,444 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 19:25:22,444 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 19:25:22,445 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 19:25:22,460 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 19:25:22,460 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 19:25:22,461 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 19:25:22,461 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 19:25:22,462 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 19:25:22,462 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 19:25:22,462 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 19:25:22,462 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 19:25:22,462 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 19:25:22,463 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 19:25:22,463 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 19:25:22,463 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 19:25:22,463 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 19:25:22,463 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 19:25:22,464 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 19:25:22,464 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 19:25:22,464 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 19:25:22,465 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 19:25:22,465 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 19:25:22,465 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 19:25:22,465 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 19:25:22,466 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 19:25:22,466 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 19:25:22,466 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 19:25:22,466 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 19:25:22,466 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 19:25:22,467 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 19:25:22,467 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 19:25:22,467 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 19:25:22,467 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 19:25:22,468 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 19:25:22,468 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 19:25:22,468 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 19:25:22,468 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 19:25:22,468 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 19:25:22,469 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 19:25:22,469 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 19:25:22,469 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 19:25:22,469 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 19:25:22,469 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 19:25:22,500 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 19:25:22,515 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 19:25:22,523 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 19:25:22,525 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 19:25:22,525 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 19:25:22,526 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl [2018-12-03 19:25:22,526 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl' [2018-12-03 19:25:22,568 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 19:25:22,570 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 19:25:22,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 19:25:22,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 19:25:22,571 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 19:25:22,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:25:22" (1/1) ... [2018-12-03 19:25:22,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:25:22" (1/1) ... [2018-12-03 19:25:22,609 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 19:25:22,609 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 19:25:22,609 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 19:25:22,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 19:25:22,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 19:25:22,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 19:25:22,613 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 19:25:22,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:25:22" (1/1) ... [2018-12-03 19:25:22,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:25:22" (1/1) ... [2018-12-03 19:25:22,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:25:22" (1/1) ... [2018-12-03 19:25:22,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:25:22" (1/1) ... [2018-12-03 19:25:22,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:25:22" (1/1) ... [2018-12-03 19:25:22,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:25:22" (1/1) ... [2018-12-03 19:25:22,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:25:22" (1/1) ... [2018-12-03 19:25:22,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 19:25:22,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 19:25:22,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 19:25:22,642 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 19:25:22,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:25:22" (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 19:25:22,714 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 19:25:22,715 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 19:25:22,715 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 19:25:22,937 INFO L272 CfgBuilder]: Using library mode [2018-12-03 19:25:22,937 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 19:25:22,938 INFO L202 PluginConnector]: Adding new model AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:25:22 BoogieIcfgContainer [2018-12-03 19:25:22,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 19:25:22,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 19:25:22,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 19:25:22,943 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 19:25:22,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:25:22" (1/2) ... [2018-12-03 19:25:22,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f9c7e60 and model type AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:25:22, skipping insertion in model container [2018-12-03 19:25:22,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:25:22" (2/2) ... [2018-12-03 19:25:22,946 INFO L112 eAbstractionObserver]: Analyzing ICFG AnnoyingVillain.bpl [2018-12-03 19:25:22,958 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 19:25:22,970 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 19:25:22,988 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 19:25:23,029 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 19:25:23,030 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 19:25:23,030 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 19:25:23,030 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 19:25:23,030 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 19:25:23,031 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 19:25:23,031 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 19:25:23,031 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 19:25:23,047 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 19:25:23,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 19:25:23,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:25:23,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 19:25:23,057 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:25:23,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:25:23,064 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-12-03 19:25:23,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:25:23,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:23,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:25:23,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:23,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:25:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:23,217 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 19:25:23,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:25:23,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 19:25:23,220 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:25:23,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:25:23,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:25:23,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:25:23,240 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 19:25:23,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:25:23,301 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-12-03 19:25:23,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:25:23,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 19:25:23,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:25:23,318 INFO L225 Difference]: With dead ends: 11 [2018-12-03 19:25:23,318 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 19:25:23,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:25:23,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 19:25:23,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 19:25:23,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 19:25:23,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 19:25:23,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 19:25:23,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:25:23,353 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 19:25:23,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:25:23,353 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 19:25:23,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 19:25:23,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:25:23,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 19:25:23,354 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:25:23,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:25:23,355 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-12-03 19:25:23,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:25:23,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:23,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:25:23,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:23,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:25:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:23,673 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-12-03 19:25:23,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:23,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:23,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:25:23,675 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 19:25:23,678 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [9] [2018-12-03 19:25:23,775 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 19:25:23,776 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 19:25:23,861 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 19:25:23,899 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 19:25:23,901 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 19:25:23,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:25:23,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 19:25:23,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:23,912 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 19:25:23,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:25:23,923 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:25:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:23,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:25:24,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:24,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:25:24,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:24,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:25:24,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 19:25:24,091 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:25:24,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 19:25:24,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 19:25:24,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 19:25:24,093 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-12-03 19:25:24,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:25:24,165 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 19:25:24,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 19:25:24,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 19:25:24,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:25:24,167 INFO L225 Difference]: With dead ends: 9 [2018-12-03 19:25:24,167 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 19:25:24,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 19:25:24,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 19:25:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 19:25:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 19:25:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 19:25:24,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-12-03 19:25:24,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:25:24,172 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 19:25:24,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 19:25:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 19:25:24,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 19:25:24,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:25:24,173 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 19:25:24,173 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:25:24,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:25:24,174 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 2 times [2018-12-03 19:25:24,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:25:24,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:24,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:25:24,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:24,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:25:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:24,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:24,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:24,335 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:25:24,335 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:25:24,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:25:24,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:24,336 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 19:25:24,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:25:24,351 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:25:24,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 19:25:24,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:25:24,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:25:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:24,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:25:24,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:24,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:25:24,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-03 19:25:24,882 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:25:24,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 19:25:24,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 19:25:24,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-03 19:25:24,883 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-12-03 19:25:24,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:25:24,960 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-12-03 19:25:24,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 19:25:24,961 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-03 19:25:24,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:25:24,961 INFO L225 Difference]: With dead ends: 11 [2018-12-03 19:25:24,961 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 19:25:24,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-03 19:25:24,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 19:25:24,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 19:25:24,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 19:25:24,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 19:25:24,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-12-03 19:25:24,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:25:24,966 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 19:25:24,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 19:25:24,967 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 19:25:24,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 19:25:24,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:25:24,968 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 19:25:24,968 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:25:24,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:25:24,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 3 times [2018-12-03 19:25:24,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:25:24,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:24,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:25:24,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:24,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:25:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:25,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:25,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:25:25,204 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:25:25,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:25:25,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:25,205 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 19:25:25,220 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:25:25,221 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:25:25,258 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:25:25,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:25:25,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:25:25,321 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:25,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:25:25,990 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:26,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:25:26,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-12-03 19:25:26,010 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:25:26,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 19:25:26,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 19:25:26,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-12-03 19:25:26,013 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-12-03 19:25:26,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:25:26,380 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-12-03 19:25:26,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 19:25:26,381 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 19:25:26,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:25:26,382 INFO L225 Difference]: With dead ends: 13 [2018-12-03 19:25:26,382 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 19:25:26,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-12-03 19:25:26,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 19:25:26,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 19:25:26,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 19:25:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 19:25:26,388 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-12-03 19:25:26,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:25:26,388 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 19:25:26,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 19:25:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 19:25:26,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 19:25:26,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:25:26,389 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 19:25:26,390 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:25:26,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:25:26,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 4 times [2018-12-03 19:25:26,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:25:26,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:26,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:25:26,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:26,392 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:25:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:26,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:26,571 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:25:26,571 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:25:26,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:25:26,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:26,572 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 19:25:26,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:25:26,584 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:25:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:26,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:25:26,678 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:26,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:25:27,632 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:27,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:25:27,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-12-03 19:25:27,653 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:25:27,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 19:25:27,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 19:25:27,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2018-12-03 19:25:27,654 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-12-03 19:25:27,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:25:27,788 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-12-03 19:25:27,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 19:25:27,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-12-03 19:25:27,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:25:27,790 INFO L225 Difference]: With dead ends: 15 [2018-12-03 19:25:27,790 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 19:25:27,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2018-12-03 19:25:27,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 19:25:27,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 19:25:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 19:25:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 19:25:27,796 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-12-03 19:25:27,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:25:27,796 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 19:25:27,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 19:25:27,796 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 19:25:27,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 19:25:27,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:25:27,797 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 19:25:27,797 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:25:27,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:25:27,798 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 5 times [2018-12-03 19:25:27,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:25:27,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:27,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:25:27,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:27,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:25:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:28,238 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:28,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:28,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:25:28,239 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:25:28,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:25:28,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:28,240 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 19:25:28,249 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:25:28,249 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:25:28,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 19:25:28,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:25:28,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:25:28,404 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:28,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:25:29,450 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:29,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:25:29,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-12-03 19:25:29,477 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:25:29,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 19:25:29,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 19:25:29,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2018-12-03 19:25:29,479 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-12-03 19:25:29,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:25:29,648 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-12-03 19:25:29,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 19:25:29,649 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-12-03 19:25:29,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:25:29,649 INFO L225 Difference]: With dead ends: 17 [2018-12-03 19:25:29,650 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 19:25:29,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2018-12-03 19:25:29,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 19:25:29,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 19:25:29,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 19:25:29,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 19:25:29,655 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-12-03 19:25:29,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:25:29,655 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 19:25:29,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 19:25:29,655 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 19:25:29,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 19:25:29,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:25:29,656 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 19:25:29,656 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:25:29,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:25:29,657 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 6 times [2018-12-03 19:25:29,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:25:29,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:29,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:25:29,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:29,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:25:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:29,927 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:29,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:29,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:25:29,928 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:25:29,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:25:29,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:29,929 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 19:25:29,943 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:25:29,943 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:25:29,955 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:25:29,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:25:29,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:25:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:30,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:25:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:34,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:25:34,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2018-12-03 19:25:34,366 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:25:34,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 19:25:34,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 19:25:34,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=506, Unknown=1, NotChecked=0, Total=702 [2018-12-03 19:25:34,368 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-12-03 19:25:34,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:25:34,594 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-12-03 19:25:34,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 19:25:34,595 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-12-03 19:25:34,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:25:34,596 INFO L225 Difference]: With dead ends: 19 [2018-12-03 19:25:34,596 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 19:25:34,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=195, Invalid=506, Unknown=1, NotChecked=0, Total=702 [2018-12-03 19:25:34,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 19:25:34,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 19:25:34,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 19:25:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 19:25:34,601 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-12-03 19:25:34,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:25:34,601 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 19:25:34,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 19:25:34,602 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 19:25:34,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 19:25:34,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:25:34,602 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 19:25:34,603 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:25:34,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:25:34,603 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 7 times [2018-12-03 19:25:34,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:25:34,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:34,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:25:34,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:34,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:25:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:34,933 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:34,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:34,934 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:25:34,934 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:25:34,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:25:34,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:34,935 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 19:25:34,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:25:34,945 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:25:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:34,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:25:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:35,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:25:42,454 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:42,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:25:42,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2018-12-03 19:25:42,473 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:25:42,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 19:25:42,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 19:25:42,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=674, Unknown=3, NotChecked=0, Total=930 [2018-12-03 19:25:42,475 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-12-03 19:25:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:25:42,880 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-12-03 19:25:42,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 19:25:42,881 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 19:25:42,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:25:42,882 INFO L225 Difference]: With dead ends: 21 [2018-12-03 19:25:42,882 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 19:25:42,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=253, Invalid=674, Unknown=3, NotChecked=0, Total=930 [2018-12-03 19:25:42,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 19:25:42,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 19:25:42,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 19:25:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 19:25:42,887 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-12-03 19:25:42,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:25:42,887 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 19:25:42,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 19:25:42,887 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 19:25:42,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 19:25:42,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:25:42,888 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 19:25:42,889 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:25:42,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:25:42,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 8 times [2018-12-03 19:25:42,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:25:42,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:42,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:25:42,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:42,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:25:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:43,314 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:43,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:43,314 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:25:43,315 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:25:43,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:25:43,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:43,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 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 19:25:43,323 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:25:43,324 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:25:43,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 19:25:43,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:25:43,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:25:43,440 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:43,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:25:55,196 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:55,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:25:55,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2018-12-03 19:25:55,217 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:25:55,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 19:25:55,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 19:25:55,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=866, Unknown=5, NotChecked=0, Total=1190 [2018-12-03 19:25:55,220 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-12-03 19:25:55,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:25:55,765 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-12-03 19:25:55,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 19:25:55,766 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 19:25:55,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:25:55,766 INFO L225 Difference]: With dead ends: 23 [2018-12-03 19:25:55,767 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 19:25:55,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=319, Invalid=866, Unknown=5, NotChecked=0, Total=1190 [2018-12-03 19:25:55,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 19:25:55,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 19:25:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 19:25:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 19:25:55,773 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-12-03 19:25:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:25:55,773 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 19:25:55,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 19:25:55,773 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 19:25:55,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 19:25:55,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:25:55,774 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 19:25:55,775 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:25:55,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:25:55,775 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 9 times [2018-12-03 19:25:55,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:25:55,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:55,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:25:55,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:55,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:25:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:58,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:58,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:25:58,191 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:25:58,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 19:25:58,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:58,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 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 19:25:58,200 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:25:58,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:25:58,213 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:25:58,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:25:58,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:25:58,276 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:58,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:26:07,260 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:07,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:26:07,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2018-12-03 19:26:07,279 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:26:07,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 19:26:07,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 19:26:07,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1081, Unknown=4, NotChecked=0, Total=1482 [2018-12-03 19:26:07,281 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-12-03 19:26:07,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:26:07,703 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-12-03 19:26:07,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 19:26:07,704 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-12-03 19:26:07,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:26:07,705 INFO L225 Difference]: With dead ends: 25 [2018-12-03 19:26:07,705 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 19:26:07,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=397, Invalid=1081, Unknown=4, NotChecked=0, Total=1482 [2018-12-03 19:26:07,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 19:26:07,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 19:26:07,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 19:26:07,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 19:26:07,711 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-12-03 19:26:07,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:26:07,711 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 19:26:07,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 19:26:07,712 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 19:26:07,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 19:26:07,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:26:07,712 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 19:26:07,713 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:26:07,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:26:07,713 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 10 times [2018-12-03 19:26:07,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:26:07,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:26:07,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:26:07,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:26:07,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:26:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:26:08,382 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:08,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:26:08,383 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:26:08,383 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:26:08,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:26:08,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:26:08,383 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 19:26:08,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:26:08,394 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:26:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:26:08,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:26:08,519 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:08,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:26:23,464 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:23,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:26:23,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2018-12-03 19:26:23,484 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:26:23,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 19:26:23,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 19:26:23,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1322, Unknown=6, NotChecked=0, Total=1806 [2018-12-03 19:26:23,547 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-12-03 19:26:24,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:26:24,090 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-12-03 19:26:24,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 19:26:24,092 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-12-03 19:26:24,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:26:24,092 INFO L225 Difference]: With dead ends: 27 [2018-12-03 19:26:24,093 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 19:26:24,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=478, Invalid=1322, Unknown=6, NotChecked=0, Total=1806 [2018-12-03 19:26:24,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 19:26:24,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 19:26:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 19:26:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 19:26:24,098 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-12-03 19:26:24,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:26:24,099 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 19:26:24,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 19:26:24,099 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 19:26:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 19:26:24,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:26:24,100 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 19:26:24,100 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:26:24,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:26:24,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 11 times [2018-12-03 19:26:24,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:26:24,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:26:24,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:26:24,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:26:24,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:26:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:26:25,096 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:25,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:26:25,097 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:26:25,097 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:26:25,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:26:25,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:26:25,098 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 19:26:25,116 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:26:25,116 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:26:25,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 19:26:25,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:26:25,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:26:25,307 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:25,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:26:35,044 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:35,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:26:35,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2018-12-03 19:26:35,065 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:26:35,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 19:26:35,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 19:26:35,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=1586, Unknown=3, NotChecked=0, Total=2162 [2018-12-03 19:26:35,067 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-12-03 19:26:35,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:26:35,618 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-12-03 19:26:35,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 19:26:35,621 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-12-03 19:26:35,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:26:35,621 INFO L225 Difference]: With dead ends: 29 [2018-12-03 19:26:35,622 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 19:26:35,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=573, Invalid=1586, Unknown=3, NotChecked=0, Total=2162 [2018-12-03 19:26:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 19:26:35,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 19:26:35,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 19:26:35,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 19:26:35,627 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-12-03 19:26:35,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:26:35,628 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 19:26:35,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 19:26:35,628 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 19:26:35,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 19:26:35,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:26:35,629 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 19:26:35,629 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:26:35,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:26:35,629 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 12 times [2018-12-03 19:26:35,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:26:35,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:26:35,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:26:35,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:26:35,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:26:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:26:36,301 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:36,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:26:36,301 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:26:36,302 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:26:36,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 19:26:36,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:26:36,302 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 19:26:36,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:26:36,313 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:26:36,329 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:26:36,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:26:36,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:26:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:36,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:26:58,642 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:58,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:26:58,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 50 [2018-12-03 19:26:58,662 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:26:58,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 19:26:58,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 19:26:58,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=1874, Unknown=8, NotChecked=0, Total=2550 [2018-12-03 19:26:58,663 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-12-03 19:27:01,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:27:01,519 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-12-03 19:27:01,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 19:27:01,520 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-12-03 19:27:01,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:27:01,521 INFO L225 Difference]: With dead ends: 31 [2018-12-03 19:27:01,521 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 19:27:01,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=668, Invalid=1874, Unknown=8, NotChecked=0, Total=2550 [2018-12-03 19:27:01,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 19:27:01,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 19:27:01,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 19:27:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 19:27:01,530 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-12-03 19:27:01,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:27:01,530 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 19:27:01,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 19:27:01,530 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 19:27:01,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 19:27:01,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:27:01,531 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 19:27:01,532 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:27:01,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:27:01,532 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 13 times [2018-12-03 19:27:01,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:27:01,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:27:01,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:27:01,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:27:01,533 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:27:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:27:02,425 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:27:02,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:27:02,426 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:27:02,426 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:27:02,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 19:27:02,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:27:02,427 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 19:27:02,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:27:02,436 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:27:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:27:02,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:27:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:27:02,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:27:29,506 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:27:29,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:27:29,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 54 [2018-12-03 19:27:29,526 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:27:29,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 19:27:29,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 19:27:29,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=773, Invalid=2186, Unknown=11, NotChecked=0, Total=2970 [2018-12-03 19:27:29,529 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-12-03 19:27:32,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:27:32,529 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-12-03 19:27:32,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 19:27:32,529 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-12-03 19:27:32,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:27:32,530 INFO L225 Difference]: With dead ends: 33 [2018-12-03 19:27:32,530 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 19:27:32,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=773, Invalid=2186, Unknown=11, NotChecked=0, Total=2970 [2018-12-03 19:27:32,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 19:27:32,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 19:27:32,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 19:27:32,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 19:27:32,537 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-12-03 19:27:32,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:27:32,537 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 19:27:32,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 19:27:32,538 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 19:27:32,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 19:27:32,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:27:32,539 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 19:27:32,539 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:27:32,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:27:32,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 14 times [2018-12-03 19:27:32,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:27:32,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:27:32,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:27:32,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:27:32,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:27:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:27:35,485 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:27:35,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:27:35,486 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:27:35,486 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:27:35,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:27:35,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:27:35,486 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 19:27:35,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:27:35,499 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:27:35,522 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 19:27:35,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:27:35,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:27:35,632 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:27:35,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:28:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:28:12,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:28:12,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 58 [2018-12-03 19:28:12,166 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:28:12,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 19:28:12,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 19:28:12,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=885, Invalid=2521, Unknown=16, NotChecked=0, Total=3422 [2018-12-03 19:28:12,168 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-12-03 19:28:13,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:28:13,953 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-12-03 19:28:13,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 19:28:13,954 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-12-03 19:28:13,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:28:13,954 INFO L225 Difference]: With dead ends: 35 [2018-12-03 19:28:13,955 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 19:28:13,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 39.4s TimeCoverageRelationStatistics Valid=885, Invalid=2521, Unknown=16, NotChecked=0, Total=3422 [2018-12-03 19:28:13,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 19:28:13,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 19:28:13,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 19:28:13,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 19:28:13,962 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-12-03 19:28:13,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:28:13,963 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 19:28:13,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 19:28:13,963 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 19:28:13,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 19:28:13,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:28:13,965 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 19:28:13,966 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:28:13,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:28:13,966 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 15 times [2018-12-03 19:28:13,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:28:13,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:28:13,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:28:13,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:28:13,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:28:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:28:17,311 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:28:17,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:28:17,311 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:28:17,311 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:28:17,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:28:17,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:28:17,312 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 19:28:17,321 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:28:17,321 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:28:17,339 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:28:17,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:28:17,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:28:17,504 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:28:17,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:28:48,369 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:28:48,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:28:48,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 62 [2018-12-03 19:28:48,391 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:28:48,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 19:28:48,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 19:28:48,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1012, Invalid=2881, Unknown=13, NotChecked=0, Total=3906 [2018-12-03 19:28:48,393 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-12-03 19:28:51,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:28:51,931 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-12-03 19:28:51,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 19:28:51,932 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-12-03 19:28:51,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:28:51,933 INFO L225 Difference]: With dead ends: 37 [2018-12-03 19:28:51,933 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 19:28:51,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=1012, Invalid=2881, Unknown=13, NotChecked=0, Total=3906 [2018-12-03 19:28:51,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 19:28:51,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 19:28:51,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 19:28:51,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 19:28:51,940 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-12-03 19:28:51,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:28:51,940 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 19:28:51,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 19:28:51,941 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 19:28:51,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 19:28:51,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:28:51,942 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 19:28:51,942 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:28:51,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:28:51,942 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 16 times [2018-12-03 19:28:51,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:28:51,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:28:51,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:28:51,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:28:51,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:28:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:28:55,500 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:28:55,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:28:55,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:28:55,501 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:28:55,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:28:55,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:28:55,501 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 19:28:55,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:28:55,511 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:28:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:28:55,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:28:56,581 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:28:56,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:29:27,304 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:29:27,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:29:27,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2018-12-03 19:29:27,324 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:29:27,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 19:29:27,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 19:29:27,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1145, Invalid=3265, Unknown=12, NotChecked=0, Total=4422 [2018-12-03 19:29:27,327 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-12-03 19:29:37,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:29:37,516 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 19:29:37,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 19:29:37,517 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-12-03 19:29:37,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:29:37,517 INFO L225 Difference]: With dead ends: 38 [2018-12-03 19:29:37,517 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 19:29:37,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 35.2s TimeCoverageRelationStatistics Valid=1145, Invalid=3265, Unknown=12, NotChecked=0, Total=4422 [2018-12-03 19:29:37,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 19:29:37,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 19:29:37,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 19:29:37,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 19:29:37,524 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 19:29:37,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:29:37,524 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 19:29:37,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 19:29:37,524 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 19:29:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 19:29:37,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:29:37,525 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-03 19:29:37,525 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:29:37,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:29:37,526 INFO L82 PathProgramCache]: Analyzing trace with hash 176046432, now seen corresponding path program 17 times [2018-12-03 19:29:37,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:29:37,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:29:37,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:29:37,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:29:37,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:29:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:29:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:29:39,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:29:39,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:29:39,004 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:29:39,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:29:39,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:29:39,005 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 19:29:39,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:29:39,014 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:29:39,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 19:29:39,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:29:39,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:29:43,237 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:29:43,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:30:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:30:18,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:30:18,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 68 [2018-12-03 19:30:18,830 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:30:18,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 19:30:18,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 19:30:18,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1211, Invalid=3466, Unknown=15, NotChecked=0, Total=4692 [2018-12-03 19:30:18,832 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-12-03 19:30:24,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:30:24,267 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-12-03 19:30:24,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 19:30:24,268 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-12-03 19:30:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:30:24,269 INFO L225 Difference]: With dead ends: 40 [2018-12-03 19:30:24,269 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 19:30:24,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 41.2s TimeCoverageRelationStatistics Valid=1211, Invalid=3466, Unknown=15, NotChecked=0, Total=4692 [2018-12-03 19:30:24,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 19:30:24,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 19:30:24,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 19:30:24,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 19:30:24,277 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-12-03 19:30:24,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:30:24,277 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 19:30:24,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 19:30:24,278 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 19:30:24,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 19:30:24,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:30:24,279 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-03 19:30:24,280 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:30:24,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:30:24,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 18 times [2018-12-03 19:30:24,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:30:24,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:30:24,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:30:24,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:30:24,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:30:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:30:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:30:25,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:30:25,583 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:30:25,583 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:30:25,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:30:25,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:30:25,583 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 19:30:25,593 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:30:25,593 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:30:25,618 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:30:25,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:30:25,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:30:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:30:25,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:31:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:31:12,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:31:12,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 72 [2018-12-03 19:31:12,014 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:31:12,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 19:31:12,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 19:31:12,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1351, Invalid=3887, Unknown=18, NotChecked=0, Total=5256 [2018-12-03 19:31:12,016 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-12-03 19:31:21,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:31:21,773 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-12-03 19:31:21,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 19:31:21,773 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-12-03 19:31:21,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:31:21,774 INFO L225 Difference]: With dead ends: 42 [2018-12-03 19:31:21,774 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 19:31:21,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 47.6s TimeCoverageRelationStatistics Valid=1351, Invalid=3887, Unknown=18, NotChecked=0, Total=5256 [2018-12-03 19:31:21,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 19:31:21,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 19:31:21,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 19:31:21,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 19:31:21,781 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-12-03 19:31:21,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:31:21,781 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 19:31:21,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 19:31:21,782 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 19:31:21,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 19:31:21,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:31:21,783 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-03 19:31:21,783 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:31:21,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:31:21,783 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 19 times [2018-12-03 19:31:21,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:31:21,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:31:21,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:31:21,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:31:21,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:31:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:31:23,324 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:31:23,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:31:23,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:31:23,325 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:31:23,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:31:23,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:31:23,325 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 19:31:23,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:31:23,337 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:31:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:31:23,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:31:23,556 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:31:23,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:32:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:32:07,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:32:07,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 76 [2018-12-03 19:32:07,303 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:32:07,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 19:32:07,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 19:32:07,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1504, Invalid=4331, Unknown=17, NotChecked=0, Total=5852 [2018-12-03 19:32:07,304 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-12-03 19:32:25,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:32:25,874 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-12-03 19:32:25,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 19:32:25,875 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-12-03 19:32:25,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:32:25,875 INFO L225 Difference]: With dead ends: 44 [2018-12-03 19:32:25,876 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 19:32:25,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 45.3s TimeCoverageRelationStatistics Valid=1504, Invalid=4331, Unknown=17, NotChecked=0, Total=5852 [2018-12-03 19:32:25,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 19:32:25,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 19:32:25,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 19:32:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 19:32:25,883 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-12-03 19:32:25,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:32:25,883 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 19:32:25,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 19:32:25,883 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 19:32:25,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 19:32:25,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:32:25,884 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-03 19:32:25,884 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:32:25,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:32:25,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972256, now seen corresponding path program 20 times [2018-12-03 19:32:25,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:32:25,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:32:25,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:32:25,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:32:25,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:32:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:32:30,539 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:32:30,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:32:30,539 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:32:30,539 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:32:30,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:32:30,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:32:30,539 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 19:32:30,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:32:30,550 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:32:30,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 19:32:30,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:32:30,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:32:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:32:30,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:33:05,599 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:33:05,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:33:05,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 80 [2018-12-03 19:33:05,619 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:33:05,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 19:33:05,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 19:33:05,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1669, Invalid=4798, Unknown=13, NotChecked=0, Total=6480 [2018-12-03 19:33:05,621 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-12-03 19:33:24,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:33:24,830 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-12-03 19:33:24,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 19:33:24,831 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-12-03 19:33:24,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:33:24,832 INFO L225 Difference]: With dead ends: 46 [2018-12-03 19:33:24,832 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 19:33:24,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 39.5s TimeCoverageRelationStatistics Valid=1669, Invalid=4798, Unknown=13, NotChecked=0, Total=6480 [2018-12-03 19:33:24,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 19:33:24,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 19:33:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 19:33:24,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 19:33:24,840 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-12-03 19:33:24,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:33:24,840 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 19:33:24,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 19:33:24,840 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 19:33:24,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 19:33:24,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:33:24,841 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-03 19:33:24,841 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:33:24,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:33:24,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791520, now seen corresponding path program 21 times [2018-12-03 19:33:24,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:33:24,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:33:24,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:33:24,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:33:24,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:33:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:33:32,824 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:33:32,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:33:32,825 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:33:32,825 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:33:32,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:33:32,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:33:32,825 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 19:33:32,834 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:33:32,834 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:33:32,861 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:33:32,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:33:32,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:33:33,347 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 735 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-12-03 19:33:33,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:33:33,406 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 735 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-12-03 19:33:33,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:33:33,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 8, 8] total 50 [2018-12-03 19:33:33,435 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:33:33,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 19:33:33,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 19:33:33,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2448, Unknown=3, NotChecked=0, Total=2550 [2018-12-03 19:33:33,437 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 51 states. [2018-12-03 19:34:00,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:00,037 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-12-03 19:34:00,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 19:34:00,040 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 43 [2018-12-03 19:34:00,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:00,041 INFO L225 Difference]: With dead ends: 67 [2018-12-03 19:34:00,041 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 19:34:00,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=291, Invalid=9405, Unknown=6, NotChecked=0, Total=9702 [2018-12-03 19:34:00,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 19:34:00,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 51. [2018-12-03 19:34:00,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 19:34:00,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-12-03 19:34:00,050 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 43 [2018-12-03 19:34:00,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:00,051 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-12-03 19:34:00,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 19:34:00,051 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-12-03 19:34:00,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 19:34:00,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:00,052 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 19:34:00,052 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:00,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:00,052 INFO L82 PathProgramCache]: Analyzing trace with hash -692041594, now seen corresponding path program 22 times [2018-12-03 19:34:00,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:00,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:00,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:00,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:00,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:10,436 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:10,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:10,436 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:10,436 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:10,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:10,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:10,437 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 19:34:10,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:10,446 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:34:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:10,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:11,538 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:11,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:19,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:19,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 86 [2018-12-03 19:35:19,157 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:19,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 19:35:19,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 19:35:19,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1909, Invalid=5542, Unknown=31, NotChecked=0, Total=7482 [2018-12-03 19:35:19,159 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 45 states. [2018-12-03 19:35:21,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:21,723 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-12-03 19:35:21,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 19:35:21,723 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-12-03 19:35:21,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:21,727 INFO L225 Difference]: With dead ends: 56 [2018-12-03 19:35:21,727 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 19:35:21,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 78.9s TimeCoverageRelationStatistics Valid=1909, Invalid=5542, Unknown=31, NotChecked=0, Total=7482 [2018-12-03 19:35:21,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 19:35:21,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 19:35:21,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 19:35:21,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-12-03 19:35:21,749 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 44 [2018-12-03 19:35:21,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:21,749 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-12-03 19:35:21,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 19:35:21,750 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-12-03 19:35:21,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 19:35:21,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:21,753 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-03 19:35:21,754 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:21,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:21,754 INFO L82 PathProgramCache]: Analyzing trace with hash 667835334, now seen corresponding path program 23 times [2018-12-03 19:35:21,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:21,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:21,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:35:21,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:21,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:30,178 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:30,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:30,179 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:30,179 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:30,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:30,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:30,179 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 19:35:30,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:35:30,190 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:35:30,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 19:35:30,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:35:30,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:31,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:26,544 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:26,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:26,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 90 [2018-12-03 19:36:26,564 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:26,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 19:36:26,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 19:36:26,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2096, Invalid=6071, Unknown=23, NotChecked=0, Total=8190 [2018-12-03 19:36:26,566 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 47 states. [2018-12-03 19:36:39,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:39,526 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-12-03 19:36:39,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 19:36:39,527 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-12-03 19:36:39,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:39,528 INFO L225 Difference]: With dead ends: 58 [2018-12-03 19:36:39,528 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 19:36:39,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 64.6s TimeCoverageRelationStatistics Valid=2096, Invalid=6071, Unknown=23, NotChecked=0, Total=8190 [2018-12-03 19:36:39,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 19:36:39,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 19:36:39,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 19:36:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-12-03 19:36:39,537 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 46 [2018-12-03 19:36:39,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:39,537 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-12-03 19:36:39,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 19:36:39,537 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-12-03 19:36:39,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 19:36:39,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:39,538 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-03 19:36:39,538 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:39,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:39,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505158, now seen corresponding path program 24 times [2018-12-03 19:36:39,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:39,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:39,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:39,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:39,540 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:48,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:48,412 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:48,412 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:48,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:48,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:48,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 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 19:36:48,421 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:36:48,421 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:36:48,450 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:36:48,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:48,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:48,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:48,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:13,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:13,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2018-12-03 19:38:13,038 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:13,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 19:38:13,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 19:38:13,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2271, Invalid=6623, Unknown=36, NotChecked=0, Total=8930 [2018-12-03 19:38:13,040 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 49 states. [2018-12-03 19:38:19,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:19,490 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-12-03 19:38:19,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 19:38:19,490 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-12-03 19:38:19,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:19,491 INFO L225 Difference]: With dead ends: 60 [2018-12-03 19:38:19,491 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 19:38:19,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 93.3s TimeCoverageRelationStatistics Valid=2271, Invalid=6623, Unknown=36, NotChecked=0, Total=8930 [2018-12-03 19:38:19,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 19:38:19,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 19:38:19,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 19:38:19,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-12-03 19:38:19,497 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 48 [2018-12-03 19:38:19,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:19,497 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-12-03 19:38:19,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 19:38:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-12-03 19:38:19,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 19:38:19,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:19,498 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-03 19:38:19,498 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:19,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:19,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192826, now seen corresponding path program 25 times [2018-12-03 19:38:19,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:19,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:19,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:38:19,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:19,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:28,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:28,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:28,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:28,316 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:28,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:38:28,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:28,317 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 19:38:28,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:38:28,326 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:38:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:28,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:28,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:28,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:39:52,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:52,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:39:52,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 98 [2018-12-03 19:39:52,315 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:39:52,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 19:39:52,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 19:39:52,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2468, Invalid=7199, Unknown=35, NotChecked=0, Total=9702 [2018-12-03 19:39:52,316 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 51 states.