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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:38:36,364 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:38:36,366 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:38:36,383 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:38:36,384 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:38:36,385 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:38:36,386 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:38:36,389 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:38:36,396 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:38:36,397 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:38:36,398 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:38:36,398 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:38:36,404 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:38:36,405 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:38:36,407 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:38:36,408 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:38:36,410 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:38:36,414 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:38:36,415 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:38:36,419 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:38:36,420 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:38:36,422 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:38:36,423 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:38:36,424 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:38:36,424 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:38:36,425 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:38:36,425 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:38:36,426 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:38:36,427 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:38:36,428 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:38:36,428 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:38:36,429 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:38:36,429 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:38:36,429 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:38:36,430 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:38:36,430 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:38:36,431 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:38:36,443 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:38:36,443 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:38:36,444 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:38:36,444 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:38:36,444 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:38:36,444 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:38:36,444 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:38:36,445 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:38:36,445 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:38:36,445 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:38:36,445 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:38:36,445 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:38:36,446 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:38:36,446 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:38:36,446 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:38:36,446 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:38:36,447 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:38:36,447 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:38:36,447 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:38:36,447 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:38:36,447 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:38:36,448 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:38:36,448 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:38:36,448 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:38:36,448 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:38:36,448 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:38:36,449 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:38:36,449 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:38:36,449 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:38:36,449 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:38:36,449 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:38:36,450 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:38:36,450 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:38:36,450 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:38:36,450 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:38:36,450 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:38:36,451 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:38:36,451 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:38:36,451 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:38:36,451 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:38:36,451 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:38:36,492 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:38:36,503 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:38:36,506 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:38:36,508 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:38:36,509 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:38:36,509 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl [2018-12-03 16:38:36,510 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl' [2018-12-03 16:38:36,552 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:38:36,554 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:38:36,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:38:36,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:38:36,555 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:38:36,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:36" (1/1) ... [2018-12-03 16:38:36,582 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:36" (1/1) ... [2018-12-03 16:38:36,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:38:36,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:38:36,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:38:36,592 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:38:36,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:36" (1/1) ... [2018-12-03 16:38:36,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:36" (1/1) ... [2018-12-03 16:38:36,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:36" (1/1) ... [2018-12-03 16:38:36,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:36" (1/1) ... [2018-12-03 16:38:36,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:36" (1/1) ... [2018-12-03 16:38:36,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:36" (1/1) ... [2018-12-03 16:38:36,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:36" (1/1) ... [2018-12-03 16:38:36,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:38:36,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:38:36,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:38:36,614 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:38:36,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:36" (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 16:38:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:38:36,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:38:36,884 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:38:36,884 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:38:36,885 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:38:36 BoogieIcfgContainer [2018-12-03 16:38:36,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:38:36,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:38:36,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:38:36,890 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:38:36,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:36" (1/2) ... [2018-12-03 16:38:36,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b59157 and model type gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:38:36, skipping insertion in model container [2018-12-03 16:38:36,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:38:36" (2/2) ... [2018-12-03 16:38:36,893 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i_4.bpl [2018-12-03 16:38:36,903 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:38:36,911 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:38:36,928 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:38:36,962 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:38:36,962 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:38:36,963 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:38:36,963 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:38:36,963 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:38:36,963 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:38:36,963 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:38:36,964 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:38:36,978 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-12-03 16:38:36,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 16:38:36,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:36,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 16:38:36,988 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:36,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:36,995 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 16:38:36,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:37,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:37,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:37,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:37,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:37,153 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 16:38:37,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:38:37,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:38:37,155 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:38:37,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:38:37,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:38:37,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:38:37,173 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-12-03 16:38:37,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:37,263 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-12-03 16:38:37,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:38:37,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 16:38:37,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:37,276 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:38:37,276 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:38:37,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:38:37,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:38:37,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 16:38:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:38:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 16:38:37,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 3 [2018-12-03 16:38:37,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:37,313 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 16:38:37,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:38:37,314 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 16:38:37,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:38:37,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:37,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 16:38:37,315 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:37,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:37,315 INFO L82 PathProgramCache]: Analyzing trace with hash 28851306, now seen corresponding path program 1 times [2018-12-03 16:38:37,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:37,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:37,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:37,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:37,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:37,466 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 16:38:37,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:37,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:37,468 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-03 16:38:37,470 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [14] [2018-12-03 16:38:37,531 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:38:37,531 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:38:37,732 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:38:37,733 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:38:37,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:37,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:38:37,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:37,784 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 16:38:37,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:37,804 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:37,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:37,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:37,987 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 16:38:37,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [3] total 6 [2018-12-03 16:38:37,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:38:37,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:38:37,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:38:37,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:38:37,990 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 3 states. [2018-12-03 16:38:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:38,033 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-12-03 16:38:38,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:38:38,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 16:38:38,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:38,034 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:38:38,035 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 16:38:38,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:38:38,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 16:38:38,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-12-03 16:38:38,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 16:38:38,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-12-03 16:38:38,039 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2018-12-03 16:38:38,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:38,040 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-12-03 16:38:38,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:38:38,040 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-03 16:38:38,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:38:38,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:38,041 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-03 16:38:38,041 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:38,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:38,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1956367763, now seen corresponding path program 1 times [2018-12-03 16:38:38,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:38,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:38,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:38,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:38,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:38,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:38,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:38,108 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:38,108 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-03 16:38:38,108 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [14], [16] [2018-12-03 16:38:38,110 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:38:38,110 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:38:38,207 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:38:38,207 INFO L272 AbstractInterpreter]: Visited 6 different actions 24 times. Merged at 5 different actions 12 times. Widened at 1 different actions 1 times. Found 4 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 16:38:38,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:38,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:38:38,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:38,218 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 16:38:38,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:38,232 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:38,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:38,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:38,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:38,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:38,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 16:38:38,375 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:38,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:38:38,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:38:38,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:38:38,377 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-12-03 16:38:38,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:38,422 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-12-03 16:38:38,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:38:38,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-03 16:38:38,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:38,424 INFO L225 Difference]: With dead ends: 15 [2018-12-03 16:38:38,424 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 16:38:38,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:38:38,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 16:38:38,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 16:38:38,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:38:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-12-03 16:38:38,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 7 [2018-12-03 16:38:38,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:38,431 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-12-03 16:38:38,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:38:38,431 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2018-12-03 16:38:38,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:38:38,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:38,433 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-12-03 16:38:38,434 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:38,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:38,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1128035974, now seen corresponding path program 2 times [2018-12-03 16:38:38,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:38,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:38,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:38,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:38,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:38,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:38,591 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:38,591 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:38,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:38,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:38,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:38:38,613 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:38:38,614 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:38:38,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:38:38,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:38,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:38,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:38,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:38,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:38,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2018-12-03 16:38:38,910 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:38,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:38:38,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:38:38,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:38:38,912 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 8 states. [2018-12-03 16:38:39,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:39,091 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2018-12-03 16:38:39,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:38:39,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 16:38:39,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:39,094 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:38:39,095 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:38:39,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:38:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:38:39,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-12-03 16:38:39,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:38:39,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-12-03 16:38:39,101 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2018-12-03 16:38:39,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:39,101 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-03 16:38:39,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:38:39,102 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2018-12-03 16:38:39,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:38:39,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:39,103 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-12-03 16:38:39,103 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:39,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:39,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1884090419, now seen corresponding path program 3 times [2018-12-03 16:38:39,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:39,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:39,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:39,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:39,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 16:38:39,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:39,215 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:39,215 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:39,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:39,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:39,215 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 16:38:39,224 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:38:39,224 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:38:39,234 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:38:39,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:39,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:39,242 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 16:38:39,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 16:38:39,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:39,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 16:38:39,348 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:39,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:38:39,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:38:39,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:38:39,349 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 6 states. [2018-12-03 16:38:39,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:39,420 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2018-12-03 16:38:39,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:38:39,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-03 16:38:39,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:39,426 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:38:39,426 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:38:39,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:38:39,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:38:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 16:38:39,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:38:39,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-12-03 16:38:39,431 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2018-12-03 16:38:39,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:39,431 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-03 16:38:39,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:38:39,432 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2018-12-03 16:38:39,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:38:39,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:39,433 INFO L402 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-12-03 16:38:39,433 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:39,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:39,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1749669146, now seen corresponding path program 4 times [2018-12-03 16:38:39,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:39,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:39,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:39,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:39,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 16:38:39,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:39,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:39,516 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:39,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:39,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:39,516 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 16:38:39,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:39,527 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:39,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:39,556 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 16:38:39,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 16:38:39,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:39,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:38:39,968 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:39,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:38:39,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:38:39,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:38:39,970 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 7 states. [2018-12-03 16:38:40,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:40,015 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2018-12-03 16:38:40,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:38:40,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-03 16:38:40,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:40,017 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:38:40,017 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:38:40,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:38:40,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:38:40,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 16:38:40,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:38:40,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-03 16:38:40,025 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2018-12-03 16:38:40,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:40,026 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-03 16:38:40,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:38:40,026 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-12-03 16:38:40,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 16:38:40,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:40,027 INFO L402 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-12-03 16:38:40,028 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:40,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:40,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1419844673, now seen corresponding path program 5 times [2018-12-03 16:38:40,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:40,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:40,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:40,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:40,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:40,132 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 16:38:40,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:40,132 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:40,132 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:40,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:40,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:40,133 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 16:38:40,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:38:40,142 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:38:40,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 16:38:40,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:40,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:40,243 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 16:38:40,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:40,320 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 16:38:40,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:40,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2018-12-03 16:38:40,342 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:40,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:38:40,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:38:40,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:38:40,343 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 12 states. [2018-12-03 16:38:40,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:40,473 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2018-12-03 16:38:40,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:38:40,474 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-12-03 16:38:40,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:40,475 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:38:40,476 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:38:40,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:38:40,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:38:40,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-12-03 16:38:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 16:38:40,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-12-03 16:38:40,482 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2018-12-03 16:38:40,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:40,482 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-12-03 16:38:40,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:38:40,483 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-12-03 16:38:40,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 16:38:40,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:40,484 INFO L402 BasicCegarLoop]: trace histogram [10, 6, 4, 1, 1, 1] [2018-12-03 16:38:40,484 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:40,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:40,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2075300015, now seen corresponding path program 6 times [2018-12-03 16:38:40,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:40,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:40,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:40,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:40,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 16:38:40,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:40,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:40,606 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:40,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:40,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:40,607 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 16:38:40,619 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:38:40,620 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:38:40,651 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:38:40,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:40,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:40,661 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 16:38:40,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:40,898 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 16:38:40,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:40,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:38:40,921 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:40,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:38:40,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:38:40,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:38:40,922 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 9 states. [2018-12-03 16:38:40,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:40,973 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-12-03 16:38:40,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:38:40,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-12-03 16:38:40,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:40,976 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:38:40,976 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:38:40,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:38:40,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:38:40,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 16:38:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 16:38:40,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-12-03 16:38:40,982 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 23 [2018-12-03 16:38:40,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:40,982 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-12-03 16:38:40,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:38:40,983 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-12-03 16:38:40,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 16:38:40,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:40,984 INFO L402 BasicCegarLoop]: trace histogram [11, 7, 4, 1, 1, 1] [2018-12-03 16:38:40,984 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:40,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:40,984 INFO L82 PathProgramCache]: Analyzing trace with hash 2095480120, now seen corresponding path program 7 times [2018-12-03 16:38:40,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:40,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:40,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:40,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:40,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 16:38:41,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:41,108 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:41,108 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:41,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:41,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:41,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:38:41,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:41,118 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:41,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 16:38:41,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:41,440 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 16:38:41,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:41,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:38:41,468 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:41,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:38:41,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:38:41,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:38:41,469 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 10 states. [2018-12-03 16:38:41,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:41,521 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2018-12-03 16:38:41,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:38:41,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-12-03 16:38:41,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:41,523 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:38:41,523 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:38:41,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:38:41,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:38:41,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 16:38:41,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 16:38:41,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-12-03 16:38:41,531 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 25 [2018-12-03 16:38:41,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:41,531 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-12-03 16:38:41,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:38:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-12-03 16:38:41,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 16:38:41,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:41,532 INFO L402 BasicCegarLoop]: trace histogram [12, 8, 4, 1, 1, 1] [2018-12-03 16:38:41,532 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:41,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:41,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1284264609, now seen corresponding path program 8 times [2018-12-03 16:38:41,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:41,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:41,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:41,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:41,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 16:38:41,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:41,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:41,715 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:41,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:41,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:41,716 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 16:38:41,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:38:41,725 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:38:41,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 16:38:41,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:41,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-03 16:38:41,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-03 16:38:41,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:41,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 21 [2018-12-03 16:38:41,928 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:41,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:38:41,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:38:41,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:38:41,929 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 16 states. [2018-12-03 16:38:42,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:42,332 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2018-12-03 16:38:42,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:38:42,333 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2018-12-03 16:38:42,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:42,333 INFO L225 Difference]: With dead ends: 44 [2018-12-03 16:38:42,333 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:38:42,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:38:42,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:38:42,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-12-03 16:38:42,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 16:38:42,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-12-03 16:38:42,339 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 27 [2018-12-03 16:38:42,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:42,339 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-03 16:38:42,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:38:42,340 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-12-03 16:38:42,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 16:38:42,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:42,340 INFO L402 BasicCegarLoop]: trace histogram [14, 9, 5, 1, 1, 1] [2018-12-03 16:38:42,341 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:42,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:42,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1943640559, now seen corresponding path program 9 times [2018-12-03 16:38:42,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:42,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:42,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:42,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:42,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 16:38:42,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:42,577 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:42,577 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:42,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:42,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:42,577 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 16:38:42,587 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:38:42,588 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:38:42,613 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:38:42,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:42,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:42,624 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 16:38:42,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 16:38:43,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:43,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:38:43,045 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:43,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:38:43,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:38:43,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:38:43,046 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 12 states. [2018-12-03 16:38:43,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:43,111 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2018-12-03 16:38:43,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:38:43,112 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-03 16:38:43,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:43,113 INFO L225 Difference]: With dead ends: 47 [2018-12-03 16:38:43,113 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:38:43,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:38:43,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:38:43,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 16:38:43,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 16:38:43,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-12-03 16:38:43,120 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 31 [2018-12-03 16:38:43,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:43,121 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-12-03 16:38:43,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:38:43,121 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-12-03 16:38:43,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 16:38:43,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:43,122 INFO L402 BasicCegarLoop]: trace histogram [15, 10, 5, 1, 1, 1] [2018-12-03 16:38:43,122 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:43,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:43,122 INFO L82 PathProgramCache]: Analyzing trace with hash 114675926, now seen corresponding path program 10 times [2018-12-03 16:38:43,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:43,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:43,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:43,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:43,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:43,283 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 16:38:43,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:43,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:43,284 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:43,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:43,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:43,284 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 16:38:43,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:43,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:43,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:43,328 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 16:38:43,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:43,735 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 16:38:43,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:43,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 16:38:43,754 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:43,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:38:43,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:38:43,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:38:43,756 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 13 states. [2018-12-03 16:38:43,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:43,795 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2018-12-03 16:38:43,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:38:43,795 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-12-03 16:38:43,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:43,796 INFO L225 Difference]: With dead ends: 49 [2018-12-03 16:38:43,797 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:38:43,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:38:43,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:38:43,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 16:38:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 16:38:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-03 16:38:43,803 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 33 [2018-12-03 16:38:43,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:43,803 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-03 16:38:43,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:38:43,804 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-03 16:38:43,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 16:38:43,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:43,805 INFO L402 BasicCegarLoop]: trace histogram [16, 11, 5, 1, 1, 1] [2018-12-03 16:38:43,805 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:43,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:43,805 INFO L82 PathProgramCache]: Analyzing trace with hash -878712323, now seen corresponding path program 11 times [2018-12-03 16:38:43,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:43,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:43,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:43,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:43,806 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 108 proven. 132 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 16:38:43,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:43,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:43,960 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:43,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:43,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:43,960 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 16:38:43,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:38:43,969 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:38:44,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 16:38:44,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:44,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 16:38:44,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 16:38:44,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:44,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 26 [2018-12-03 16:38:44,529 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:44,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:38:44,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:38:44,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:38:44,531 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 20 states. [2018-12-03 16:38:44,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:44,633 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2018-12-03 16:38:44,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:38:44,634 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2018-12-03 16:38:44,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:44,634 INFO L225 Difference]: With dead ends: 54 [2018-12-03 16:38:44,634 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 16:38:44,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:38:44,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 16:38:44,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-12-03 16:38:44,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 16:38:44,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-12-03 16:38:44,640 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 35 [2018-12-03 16:38:44,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:44,641 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-03 16:38:44,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:38:44,641 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-12-03 16:38:44,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 16:38:44,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:44,642 INFO L402 BasicCegarLoop]: trace histogram [18, 12, 6, 1, 1, 1] [2018-12-03 16:38:44,642 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:44,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:44,643 INFO L82 PathProgramCache]: Analyzing trace with hash 361336845, now seen corresponding path program 12 times [2018-12-03 16:38:44,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:44,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:44,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:44,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:44,644 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:44,796 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 16:38:44,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:44,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:44,797 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:44,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:44,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:44,797 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 16:38:44,806 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:38:44,806 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:38:44,846 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:38:44,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:44,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:44,856 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 16:38:44,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:45,396 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 16:38:45,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:45,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 16:38:45,415 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:45,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:38:45,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:38:45,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:38:45,416 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 15 states. [2018-12-03 16:38:45,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:45,499 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2018-12-03 16:38:45,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:38:45,500 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-12-03 16:38:45,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:45,503 INFO L225 Difference]: With dead ends: 57 [2018-12-03 16:38:45,503 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 16:38:45,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:38:45,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 16:38:45,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 16:38:45,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 16:38:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-12-03 16:38:45,511 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 39 [2018-12-03 16:38:45,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:45,511 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-12-03 16:38:45,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:38:45,511 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-12-03 16:38:45,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 16:38:45,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:45,512 INFO L402 BasicCegarLoop]: trace histogram [19, 13, 6, 1, 1, 1] [2018-12-03 16:38:45,513 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:45,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:45,513 INFO L82 PathProgramCache]: Analyzing trace with hash 632287220, now seen corresponding path program 13 times [2018-12-03 16:38:45,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:45,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:45,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:45,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:45,514 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:45,750 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 16:38:45,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:45,750 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:45,750 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:45,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:45,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:45,751 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 16:38:45,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:45,760 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:45,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 16:38:45,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:46,479 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 16:38:46,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:46,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 16:38:46,498 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:46,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:38:46,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:38:46,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:38:46,499 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 16 states. [2018-12-03 16:38:46,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:46,562 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2018-12-03 16:38:46,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:38:46,563 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-12-03 16:38:46,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:46,564 INFO L225 Difference]: With dead ends: 59 [2018-12-03 16:38:46,565 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 16:38:46,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:38:46,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 16:38:46,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 16:38:46,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 16:38:46,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-12-03 16:38:46,572 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 41 [2018-12-03 16:38:46,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:46,573 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-12-03 16:38:46,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:38:46,573 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-12-03 16:38:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 16:38:46,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:46,574 INFO L402 BasicCegarLoop]: trace histogram [20, 14, 6, 1, 1, 1] [2018-12-03 16:38:46,574 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:46,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:46,575 INFO L82 PathProgramCache]: Analyzing trace with hash -977407461, now seen corresponding path program 14 times [2018-12-03 16:38:46,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:46,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:46,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:46,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:46,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:46,889 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 210 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 16:38:46,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:46,890 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:46,890 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:46,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:46,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:46,890 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 16:38:46,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:38:46,905 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:38:46,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 16:38:46,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:46,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-12-03 16:38:47,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-12-03 16:38:47,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:47,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 31 [2018-12-03 16:38:47,359 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:47,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:38:47,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:38:47,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:38:47,360 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 24 states. [2018-12-03 16:38:47,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:47,475 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2018-12-03 16:38:47,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:38:47,476 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2018-12-03 16:38:47,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:47,477 INFO L225 Difference]: With dead ends: 64 [2018-12-03 16:38:47,477 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 16:38:47,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:38:47,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 16:38:47,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-12-03 16:38:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 16:38:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-12-03 16:38:47,484 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 43 [2018-12-03 16:38:47,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:47,485 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-12-03 16:38:47,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:38:47,485 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-12-03 16:38:47,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 16:38:47,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:47,486 INFO L402 BasicCegarLoop]: trace histogram [22, 15, 7, 1, 1, 1] [2018-12-03 16:38:47,486 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:47,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:47,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1433235883, now seen corresponding path program 15 times [2018-12-03 16:38:47,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:47,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:47,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:47,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:47,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:47,949 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:38:47,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:47,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:47,950 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:47,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:47,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:47,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:38:47,959 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:38:47,960 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:38:47,976 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:38:47,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:47,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:47,987 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:38:47,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:48,679 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:38:48,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:48,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 16:38:48,698 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:48,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:38:48,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:38:48,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:38:48,700 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 18 states. [2018-12-03 16:38:48,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:48,815 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-12-03 16:38:48,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:38:48,816 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-12-03 16:38:48,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:48,816 INFO L225 Difference]: With dead ends: 67 [2018-12-03 16:38:48,816 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 16:38:48,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:38:48,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 16:38:48,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 16:38:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 16:38:48,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-12-03 16:38:48,823 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 47 [2018-12-03 16:38:48,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:48,823 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-12-03 16:38:48,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:38:48,823 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-12-03 16:38:48,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 16:38:48,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:48,824 INFO L402 BasicCegarLoop]: trace histogram [23, 16, 7, 1, 1, 1] [2018-12-03 16:38:48,824 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:48,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:48,825 INFO L82 PathProgramCache]: Analyzing trace with hash 243595922, now seen corresponding path program 16 times [2018-12-03 16:38:48,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:48,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:48,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:48,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:48,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:49,201 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:38:49,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:49,202 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:49,202 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:49,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:49,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:49,202 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 16:38:49,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:49,212 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:49,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:49,240 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:38:49,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:50,111 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:38:50,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:50,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 16:38:50,130 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:50,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:38:50,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:38:50,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:38:50,131 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 19 states. [2018-12-03 16:38:50,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:50,199 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2018-12-03 16:38:50,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:38:50,199 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-12-03 16:38:50,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:50,200 INFO L225 Difference]: With dead ends: 69 [2018-12-03 16:38:50,201 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 16:38:50,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:38:50,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 16:38:50,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 16:38:50,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 16:38:50,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-12-03 16:38:50,209 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 49 [2018-12-03 16:38:50,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:50,209 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-12-03 16:38:50,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:38:50,209 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-12-03 16:38:50,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 16:38:50,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:50,210 INFO L402 BasicCegarLoop]: trace histogram [24, 17, 7, 1, 1, 1] [2018-12-03 16:38:50,211 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:50,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:50,211 INFO L82 PathProgramCache]: Analyzing trace with hash -539105863, now seen corresponding path program 17 times [2018-12-03 16:38:50,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:50,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:50,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:50,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:50,213 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:50,845 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 306 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:38:50,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:50,845 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:50,846 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:50,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:50,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:50,846 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:50,855 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:38:50,855 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:38:50,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 16:38:50,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:50,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:51,170 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-12-03 16:38:51,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-12-03 16:38:51,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:51,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 10] total 36 [2018-12-03 16:38:51,852 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:51,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:38:51,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:38:51,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:38:51,853 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 28 states. [2018-12-03 16:38:52,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:52,255 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2018-12-03 16:38:52,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:38:52,255 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2018-12-03 16:38:52,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:52,256 INFO L225 Difference]: With dead ends: 74 [2018-12-03 16:38:52,256 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 16:38:52,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:38:52,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 16:38:52,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-12-03 16:38:52,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 16:38:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-12-03 16:38:52,263 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 51 [2018-12-03 16:38:52,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:52,263 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-12-03 16:38:52,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:38:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-12-03 16:38:52,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 16:38:52,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:52,264 INFO L402 BasicCegarLoop]: trace histogram [26, 18, 8, 1, 1, 1] [2018-12-03 16:38:52,264 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:52,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:52,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1223860535, now seen corresponding path program 18 times [2018-12-03 16:38:52,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:52,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:52,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:52,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:52,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 16:38:52,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:52,565 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:52,566 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:52,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:52,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:52,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:38:52,577 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:38:52,577 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:38:52,595 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:38:52,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:52,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 16:38:52,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 16:38:53,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:53,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 16:38:53,939 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:53,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:38:53,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:38:53,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:38:53,940 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 21 states. [2018-12-03 16:38:54,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:54,140 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2018-12-03 16:38:54,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:38:54,140 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-12-03 16:38:54,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:54,141 INFO L225 Difference]: With dead ends: 77 [2018-12-03 16:38:54,141 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 16:38:54,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:38:54,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 16:38:54,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 16:38:54,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 16:38:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-12-03 16:38:54,148 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 55 [2018-12-03 16:38:54,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:54,149 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-12-03 16:38:54,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:38:54,149 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-12-03 16:38:54,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 16:38:54,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:54,150 INFO L402 BasicCegarLoop]: trace histogram [27, 19, 8, 1, 1, 1] [2018-12-03 16:38:54,150 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:54,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:54,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1914892112, now seen corresponding path program 19 times [2018-12-03 16:38:54,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:54,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:54,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:54,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:54,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 16:38:54,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:54,511 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:54,511 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:54,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:54,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:54,511 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 16:38:54,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:54,528 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:54,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:54,556 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 16:38:54,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:55,031 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 16:38:55,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:55,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 16:38:55,050 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:55,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:38:55,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:38:55,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:38:55,052 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 22 states. [2018-12-03 16:38:55,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:55,142 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2018-12-03 16:38:55,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:38:55,143 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2018-12-03 16:38:55,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:55,144 INFO L225 Difference]: With dead ends: 79 [2018-12-03 16:38:55,144 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 16:38:55,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:38:55,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 16:38:55,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 16:38:55,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 16:38:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-12-03 16:38:55,150 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 57 [2018-12-03 16:38:55,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:55,150 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-12-03 16:38:55,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:38:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-12-03 16:38:55,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 16:38:55,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:55,151 INFO L402 BasicCegarLoop]: trace histogram [28, 20, 8, 1, 1, 1] [2018-12-03 16:38:55,151 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:55,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:55,152 INFO L82 PathProgramCache]: Analyzing trace with hash -276306729, now seen corresponding path program 20 times [2018-12-03 16:38:55,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:55,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:55,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:55,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:55,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:55,386 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 420 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 16:38:55,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:55,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:55,386 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:55,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:55,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:55,387 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 16:38:55,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:38:55,403 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:38:55,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 16:38:55,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:55,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-12-03 16:38:55,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-12-03 16:38:55,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:55,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 41 [2018-12-03 16:38:55,837 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:55,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 16:38:55,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 16:38:55,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 16:38:55,838 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 32 states. [2018-12-03 16:38:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:56,000 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2018-12-03 16:38:56,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:38:56,003 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 59 [2018-12-03 16:38:56,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:56,004 INFO L225 Difference]: With dead ends: 84 [2018-12-03 16:38:56,005 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 16:38:56,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 16:38:56,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 16:38:56,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-12-03 16:38:56,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 16:38:56,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-12-03 16:38:56,011 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 59 [2018-12-03 16:38:56,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:56,011 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-12-03 16:38:56,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 16:38:56,012 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-12-03 16:38:56,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 16:38:56,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:56,013 INFO L402 BasicCegarLoop]: trace histogram [30, 21, 9, 1, 1, 1] [2018-12-03 16:38:56,013 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:56,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:56,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1466529639, now seen corresponding path program 21 times [2018-12-03 16:38:56,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:56,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:56,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:56,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:56,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:56,318 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 16:38:56,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:56,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:56,319 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:56,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:56,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:56,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:38:56,328 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:38:56,328 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:38:56,347 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:38:56,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:56,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 16:38:56,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:56,889 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 16:38:56,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:56,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 16:38:56,909 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:56,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:38:56,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:38:56,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:38:56,912 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 24 states. [2018-12-03 16:38:56,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:56,988 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2018-12-03 16:38:56,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:38:56,989 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2018-12-03 16:38:56,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:56,990 INFO L225 Difference]: With dead ends: 87 [2018-12-03 16:38:56,990 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 16:38:56,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:38:56,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 16:38:56,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 16:38:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 16:38:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2018-12-03 16:38:56,995 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 63 [2018-12-03 16:38:56,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:56,995 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2018-12-03 16:38:56,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:38:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-12-03 16:38:56,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 16:38:56,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:56,996 INFO L402 BasicCegarLoop]: trace histogram [31, 22, 9, 1, 1, 1] [2018-12-03 16:38:56,997 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:56,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:56,997 INFO L82 PathProgramCache]: Analyzing trace with hash 163074638, now seen corresponding path program 22 times [2018-12-03 16:38:56,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:56,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:56,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:56,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:56,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:57,912 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 16:38:57,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:57,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:57,915 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:57,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:57,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:57,915 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 16:38:57,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:57,929 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:57,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:57,966 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 16:38:57,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:59,001 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 16:38:59,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:59,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 16:38:59,019 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:59,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 16:38:59,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 16:38:59,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:38:59,021 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 25 states. [2018-12-03 16:38:59,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:59,126 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2018-12-03 16:38:59,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:38:59,127 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 65 [2018-12-03 16:38:59,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:59,128 INFO L225 Difference]: With dead ends: 89 [2018-12-03 16:38:59,128 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 16:38:59,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:38:59,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 16:38:59,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 16:38:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 16:38:59,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2018-12-03 16:38:59,134 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 65 [2018-12-03 16:38:59,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:59,134 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-12-03 16:38:59,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 16:38:59,135 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2018-12-03 16:38:59,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 16:38:59,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:59,136 INFO L402 BasicCegarLoop]: trace histogram [32, 23, 9, 1, 1, 1] [2018-12-03 16:38:59,136 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:59,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:59,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1673269109, now seen corresponding path program 23 times [2018-12-03 16:38:59,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:59,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:59,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:59,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:59,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:59,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 408 proven. 552 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 16:38:59,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:59,701 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:59,701 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:59,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:59,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:59,701 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:38:59,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:38:59,709 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:38:59,731 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 16:38:59,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:59,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-12-03 16:38:59,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-12-03 16:39:00,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:00,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12, 12] total 46 [2018-12-03 16:39:00,233 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:00,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 16:39:00,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 16:39:00,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:39:00,234 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 36 states. [2018-12-03 16:39:00,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:00,516 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2018-12-03 16:39:00,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:39:00,517 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2018-12-03 16:39:00,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:00,518 INFO L225 Difference]: With dead ends: 94 [2018-12-03 16:39:00,518 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 16:39:00,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:39:00,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 16:39:00,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-12-03 16:39:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 16:39:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2018-12-03 16:39:00,525 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 67 [2018-12-03 16:39:00,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:00,525 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2018-12-03 16:39:00,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 16:39:00,525 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2018-12-03 16:39:00,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 16:39:00,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:00,526 INFO L402 BasicCegarLoop]: trace histogram [34, 24, 10, 1, 1, 1] [2018-12-03 16:39:00,526 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:00,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:00,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1861868421, now seen corresponding path program 24 times [2018-12-03 16:39:00,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:00,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:00,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:00,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:00,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:01,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 16:39:01,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:01,691 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:01,692 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:01,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:01,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:01,692 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 16:39:01,701 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:01,701 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:01,733 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:01,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:01,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:01,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 16:39:01,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:02,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 16:39:02,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:02,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 16:39:02,488 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:02,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 16:39:02,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 16:39:02,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:02,490 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 27 states. [2018-12-03 16:39:02,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:02,616 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2018-12-03 16:39:02,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:39:02,617 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 71 [2018-12-03 16:39:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:02,618 INFO L225 Difference]: With dead ends: 97 [2018-12-03 16:39:02,618 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 16:39:02,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:02,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 16:39:02,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 16:39:02,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 16:39:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2018-12-03 16:39:02,623 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 71 [2018-12-03 16:39:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:02,624 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2018-12-03 16:39:02,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 16:39:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2018-12-03 16:39:02,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 16:39:02,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:02,624 INFO L402 BasicCegarLoop]: trace histogram [35, 25, 10, 1, 1, 1] [2018-12-03 16:39:02,625 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:02,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:02,625 INFO L82 PathProgramCache]: Analyzing trace with hash 59694956, now seen corresponding path program 25 times [2018-12-03 16:39:02,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:02,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:02,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:02,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:02,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 16:39:03,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:03,568 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:03,568 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:03,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:03,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:03,568 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:03,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:03,576 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:03,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:03,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 16:39:03,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 16:39:04,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:04,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 51 [2018-12-03 16:39:04,636 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:04,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:39:04,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:39:04,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:04,638 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 28 states. [2018-12-03 16:39:05,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:05,085 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2018-12-03 16:39:05,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:39:05,086 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 73 [2018-12-03 16:39:05,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:05,087 INFO L225 Difference]: With dead ends: 99 [2018-12-03 16:39:05,087 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 16:39:05,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:05,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 16:39:05,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 16:39:05,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 16:39:05,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-12-03 16:39:05,093 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 73 [2018-12-03 16:39:05,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:05,093 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-12-03 16:39:05,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:39:05,093 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-12-03 16:39:05,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 16:39:05,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:05,094 INFO L402 BasicCegarLoop]: trace histogram [36, 26, 10, 1, 1, 1] [2018-12-03 16:39:05,094 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:05,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:05,094 INFO L82 PathProgramCache]: Analyzing trace with hash -957184621, now seen corresponding path program 26 times [2018-12-03 16:39:05,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:05,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:05,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:05,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:05,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 513 proven. 702 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 16:39:05,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:05,548 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:05,548 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:05,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:05,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:05,549 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:05,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:05,559 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:05,582 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 16:39:05,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:05,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:05,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-12-03 16:39:05,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:06,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-12-03 16:39:06,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:06,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 13, 13] total 51 [2018-12-03 16:39:06,218 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:06,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 16:39:06,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 16:39:06,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 16:39:06,220 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 40 states. [2018-12-03 16:39:06,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:06,394 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2018-12-03 16:39:06,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:39:06,394 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 75 [2018-12-03 16:39:06,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:06,395 INFO L225 Difference]: With dead ends: 104 [2018-12-03 16:39:06,396 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 16:39:06,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 16:39:06,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 16:39:06,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-12-03 16:39:06,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 16:39:06,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2018-12-03 16:39:06,402 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 75 [2018-12-03 16:39:06,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:06,402 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2018-12-03 16:39:06,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 16:39:06,402 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2018-12-03 16:39:06,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 16:39:06,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:06,403 INFO L402 BasicCegarLoop]: trace histogram [38, 27, 11, 1, 1, 1] [2018-12-03 16:39:06,403 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:06,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:06,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1403956003, now seen corresponding path program 27 times [2018-12-03 16:39:06,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:06,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:06,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:06,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:06,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:06,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 16:39:06,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:06,762 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:06,762 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:06,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:06,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:06,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:06,772 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:06,772 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:06,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:06,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:06,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:06,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 16:39:06,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:07,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 16:39:07,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:07,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 51 [2018-12-03 16:39:07,563 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:07,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 16:39:07,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 16:39:07,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:07,565 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 30 states. [2018-12-03 16:39:07,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:07,646 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2018-12-03 16:39:07,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:39:07,646 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 79 [2018-12-03 16:39:07,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:07,648 INFO L225 Difference]: With dead ends: 107 [2018-12-03 16:39:07,648 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 16:39:07,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:07,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 16:39:07,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 16:39:07,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 16:39:07,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-12-03 16:39:07,654 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 79 [2018-12-03 16:39:07,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:07,654 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-12-03 16:39:07,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 16:39:07,655 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-12-03 16:39:07,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 16:39:07,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:07,655 INFO L402 BasicCegarLoop]: trace histogram [39, 28, 11, 1, 1, 1] [2018-12-03 16:39:07,655 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:07,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:07,656 INFO L82 PathProgramCache]: Analyzing trace with hash 441505802, now seen corresponding path program 28 times [2018-12-03 16:39:07,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:07,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:07,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:07,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:07,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 16:39:08,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:08,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:08,114 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:08,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:08,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:08,115 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:08,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:08,123 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:08,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:08,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 16:39:08,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:09,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 16:39:09,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:09,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 51 [2018-12-03 16:39:09,490 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:09,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 16:39:09,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 16:39:09,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:09,492 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 31 states. [2018-12-03 16:39:09,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:09,634 INFO L93 Difference]: Finished difference Result 109 states and 132 transitions. [2018-12-03 16:39:09,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 16:39:09,635 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 81 [2018-12-03 16:39:09,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:09,636 INFO L225 Difference]: With dead ends: 109 [2018-12-03 16:39:09,637 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 16:39:09,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 132 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:09,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 16:39:09,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 16:39:09,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 16:39:09,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2018-12-03 16:39:09,644 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 81 [2018-12-03 16:39:09,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:09,644 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2018-12-03 16:39:09,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 16:39:09,645 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2018-12-03 16:39:09,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 16:39:09,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:09,645 INFO L402 BasicCegarLoop]: trace histogram [40, 29, 11, 1, 1, 1] [2018-12-03 16:39:09,646 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:09,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:09,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1055168719, now seen corresponding path program 29 times [2018-12-03 16:39:09,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:09,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:09,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:09,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:09,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:10,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 630 proven. 870 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 16:39:10,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:10,243 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:10,243 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:10,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:10,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:10,243 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:10,253 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:10,253 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:10,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 16:39:10,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:10,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:10,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-12-03 16:39:10,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-12-03 16:39:11,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:11,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 14, 14] total 56 [2018-12-03 16:39:11,069 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:11,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 16:39:11,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 16:39:11,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:39:11,070 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand 44 states. [2018-12-03 16:39:11,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:11,258 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2018-12-03 16:39:11,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 16:39:11,259 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 83 [2018-12-03 16:39:11,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:11,260 INFO L225 Difference]: With dead ends: 114 [2018-12-03 16:39:11,260 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 16:39:11,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:39:11,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 16:39:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-12-03 16:39:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 16:39:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2018-12-03 16:39:11,265 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 83 [2018-12-03 16:39:11,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:11,265 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2018-12-03 16:39:11,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 16:39:11,265 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2018-12-03 16:39:11,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 16:39:11,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:11,266 INFO L402 BasicCegarLoop]: trace histogram [42, 30, 12, 1, 1, 1] [2018-12-03 16:39:11,266 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:11,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:11,266 INFO L82 PathProgramCache]: Analyzing trace with hash -84933055, now seen corresponding path program 30 times [2018-12-03 16:39:11,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:11,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:11,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:11,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:11,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:12,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 16:39:12,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:12,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:12,528 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:12,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:12,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:12,529 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:12,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:12,542 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:12,570 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:12,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:12,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:12,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 16:39:12,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:13,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 16:39:13,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:13,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 51 [2018-12-03 16:39:13,755 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:13,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 16:39:13,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 16:39:13,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:13,757 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand 33 states. [2018-12-03 16:39:13,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:13,976 INFO L93 Difference]: Finished difference Result 117 states and 142 transitions. [2018-12-03 16:39:13,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 16:39:13,977 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 87 [2018-12-03 16:39:13,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:13,977 INFO L225 Difference]: With dead ends: 117 [2018-12-03 16:39:13,977 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 16:39:13,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 142 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:13,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 16:39:13,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 16:39:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 16:39:13,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2018-12-03 16:39:13,982 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 87 [2018-12-03 16:39:13,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:13,982 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2018-12-03 16:39:13,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 16:39:13,983 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2018-12-03 16:39:13,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 16:39:13,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:13,983 INFO L402 BasicCegarLoop]: trace histogram [43, 31, 12, 1, 1, 1] [2018-12-03 16:39:13,984 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:13,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:13,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1939448792, now seen corresponding path program 31 times [2018-12-03 16:39:13,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:13,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:13,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:13,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:13,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 16:39:14,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:14,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:14,431 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:14,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:14,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:14,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:14,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:14,440 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:14,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:14,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 16:39:14,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:15,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 16:39:15,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:15,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2018-12-03 16:39:15,304 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:15,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 16:39:15,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 16:39:15,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:15,305 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 34 states. [2018-12-03 16:39:15,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:15,432 INFO L93 Difference]: Finished difference Result 119 states and 144 transitions. [2018-12-03 16:39:15,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 16:39:15,433 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 89 [2018-12-03 16:39:15,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:15,434 INFO L225 Difference]: With dead ends: 119 [2018-12-03 16:39:15,434 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 16:39:15,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 145 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:15,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 16:39:15,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 16:39:15,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 16:39:15,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2018-12-03 16:39:15,441 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 89 [2018-12-03 16:39:15,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:15,441 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2018-12-03 16:39:15,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 16:39:15,441 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2018-12-03 16:39:15,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 16:39:15,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:15,442 INFO L402 BasicCegarLoop]: trace histogram [44, 32, 12, 1, 1, 1] [2018-12-03 16:39:15,442 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:15,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:15,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1717644209, now seen corresponding path program 32 times [2018-12-03 16:39:15,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:15,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:15,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:15,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:15,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:16,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 759 proven. 1056 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 16:39:16,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:16,159 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:16,159 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:16,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:16,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:16,159 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:16,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:16,168 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:16,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 16:39:16,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:16,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:17,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-12-03 16:39:17,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-12-03 16:39:17,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:17,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 15, 15] total 61 [2018-12-03 16:39:17,815 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:17,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:39:17,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:39:17,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 16:39:17,816 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand 48 states. [2018-12-03 16:39:18,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:18,028 INFO L93 Difference]: Finished difference Result 124 states and 152 transitions. [2018-12-03 16:39:18,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:39:18,028 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 91 [2018-12-03 16:39:18,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:18,029 INFO L225 Difference]: With dead ends: 124 [2018-12-03 16:39:18,029 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 16:39:18,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 16:39:18,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 16:39:18,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-12-03 16:39:18,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 16:39:18,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2018-12-03 16:39:18,035 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 91 [2018-12-03 16:39:18,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:18,036 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2018-12-03 16:39:18,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:39:18,036 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2018-12-03 16:39:18,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 16:39:18,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:18,037 INFO L402 BasicCegarLoop]: trace histogram [46, 33, 13, 1, 1, 1] [2018-12-03 16:39:18,037 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:18,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:18,037 INFO L82 PathProgramCache]: Analyzing trace with hash -73528097, now seen corresponding path program 33 times [2018-12-03 16:39:18,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:18,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:18,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:18,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:18,038 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 16:39:18,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:18,987 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:18,987 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:18,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:18,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:18,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:18,995 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:18,996 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:19,022 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:19,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:19,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:19,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 16:39:19,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:19,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 16:39:19,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:19,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 51 [2018-12-03 16:39:19,923 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:19,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 16:39:19,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 16:39:19,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:19,924 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand 36 states. [2018-12-03 16:39:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:20,029 INFO L93 Difference]: Finished difference Result 127 states and 154 transitions. [2018-12-03 16:39:20,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:39:20,029 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 95 [2018-12-03 16:39:20,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:20,030 INFO L225 Difference]: With dead ends: 127 [2018-12-03 16:39:20,031 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 16:39:20,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 155 SyntacticMatches, 18 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:20,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 16:39:20,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 16:39:20,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 16:39:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2018-12-03 16:39:20,036 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 95 [2018-12-03 16:39:20,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:20,037 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2018-12-03 16:39:20,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 16:39:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2018-12-03 16:39:20,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 16:39:20,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:20,038 INFO L402 BasicCegarLoop]: trace histogram [47, 34, 13, 1, 1, 1] [2018-12-03 16:39:20,038 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:20,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:20,038 INFO L82 PathProgramCache]: Analyzing trace with hash 967805894, now seen corresponding path program 34 times [2018-12-03 16:39:20,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:20,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:20,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:20,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:20,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 16:39:20,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:20,598 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:20,598 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:20,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:20,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:20,599 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:20,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:20,608 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:20,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 16:39:20,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 16:39:21,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:21,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 51 [2018-12-03 16:39:21,661 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:21,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 16:39:21,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 16:39:21,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:21,662 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand 37 states. [2018-12-03 16:39:21,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:21,803 INFO L93 Difference]: Finished difference Result 129 states and 156 transitions. [2018-12-03 16:39:21,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 16:39:21,804 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 97 [2018-12-03 16:39:21,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:21,805 INFO L225 Difference]: With dead ends: 129 [2018-12-03 16:39:21,805 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 16:39:21,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 158 SyntacticMatches, 20 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:21,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 16:39:21,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 16:39:21,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 16:39:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2018-12-03 16:39:21,811 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 97 [2018-12-03 16:39:21,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:21,812 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2018-12-03 16:39:21,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 16:39:21,812 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2018-12-03 16:39:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 16:39:21,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:21,813 INFO L402 BasicCegarLoop]: trace histogram [48, 35, 13, 1, 1, 1] [2018-12-03 16:39:21,813 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:21,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:21,813 INFO L82 PathProgramCache]: Analyzing trace with hash 962391277, now seen corresponding path program 35 times [2018-12-03 16:39:21,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:21,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:21,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:21,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:21,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:22,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 900 proven. 1260 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 16:39:22,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:22,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:22,586 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:22,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:22,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:22,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:22,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:22,594 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:22,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 16:39:22,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:22,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-12-03 16:39:23,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:23,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-12-03 16:39:23,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:23,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 16, 16] total 66 [2018-12-03 16:39:23,969 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:23,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:39:23,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:39:23,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:39:23,971 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 52 states. [2018-12-03 16:39:24,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:24,242 INFO L93 Difference]: Finished difference Result 134 states and 164 transitions. [2018-12-03 16:39:24,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:39:24,243 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 99 [2018-12-03 16:39:24,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:24,244 INFO L225 Difference]: With dead ends: 134 [2018-12-03 16:39:24,244 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 16:39:24,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:39:24,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 16:39:24,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-12-03 16:39:24,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 16:39:24,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2018-12-03 16:39:24,249 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 99 [2018-12-03 16:39:24,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:24,249 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2018-12-03 16:39:24,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:39:24,250 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2018-12-03 16:39:24,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 16:39:24,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:24,250 INFO L402 BasicCegarLoop]: trace histogram [50, 36, 14, 1, 1, 1] [2018-12-03 16:39:24,251 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:24,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:24,251 INFO L82 PathProgramCache]: Analyzing trace with hash 269541117, now seen corresponding path program 36 times [2018-12-03 16:39:24,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:24,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:24,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:24,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:24,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 16:39:24,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:24,912 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:24,912 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:24,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:24,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:24,913 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:24,922 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:24,922 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:24,952 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:24,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:24,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 16:39:24,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:25,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 16:39:25,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:25,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 51 [2018-12-03 16:39:25,933 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:25,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 16:39:25,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 16:39:25,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:25,935 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand 39 states. [2018-12-03 16:39:26,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:26,139 INFO L93 Difference]: Finished difference Result 137 states and 166 transitions. [2018-12-03 16:39:26,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 16:39:26,140 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 103 [2018-12-03 16:39:26,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:26,141 INFO L225 Difference]: With dead ends: 137 [2018-12-03 16:39:26,141 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 16:39:26,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 168 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:26,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 16:39:26,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 16:39:26,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 16:39:26,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-12-03 16:39:26,148 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 103 [2018-12-03 16:39:26,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:26,148 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-12-03 16:39:26,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 16:39:26,149 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-12-03 16:39:26,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 16:39:26,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:26,149 INFO L402 BasicCegarLoop]: trace histogram [51, 37, 14, 1, 1, 1] [2018-12-03 16:39:26,150 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:26,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:26,150 INFO L82 PathProgramCache]: Analyzing trace with hash 629442276, now seen corresponding path program 37 times [2018-12-03 16:39:26,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:26,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:26,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:26,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:26,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:26,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 16:39:26,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:26,838 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:26,838 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:26,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:26,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:26,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:26,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:26,847 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:26,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:26,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 16:39:26,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:27,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 16:39:27,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:27,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 51 [2018-12-03 16:39:27,812 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:27,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 16:39:27,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 16:39:27,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:27,814 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 40 states. [2018-12-03 16:39:27,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:27,986 INFO L93 Difference]: Finished difference Result 139 states and 168 transitions. [2018-12-03 16:39:27,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:39:27,987 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 105 [2018-12-03 16:39:27,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:27,988 INFO L225 Difference]: With dead ends: 139 [2018-12-03 16:39:27,988 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 16:39:27,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 171 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:27,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 16:39:27,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 16:39:27,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 16:39:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2018-12-03 16:39:27,995 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 105 [2018-12-03 16:39:27,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:27,995 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2018-12-03 16:39:27,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 16:39:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2018-12-03 16:39:27,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 16:39:27,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:27,996 INFO L402 BasicCegarLoop]: trace histogram [52, 38, 14, 1, 1, 1] [2018-12-03 16:39:27,996 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:27,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:27,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1397894901, now seen corresponding path program 38 times [2018-12-03 16:39:27,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:27,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:27,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:27,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:27,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:28,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1053 proven. 1482 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 16:39:28,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:28,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:28,827 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:28,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:28,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:28,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:28,835 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:28,836 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:28,901 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 16:39:28,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:28,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:29,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-12-03 16:39:29,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-12-03 16:39:30,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:30,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 17, 17] total 71 [2018-12-03 16:39:30,121 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:30,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 16:39:30,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 16:39:30,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:39:30,122 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand 56 states. [2018-12-03 16:39:30,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:30,418 INFO L93 Difference]: Finished difference Result 144 states and 176 transitions. [2018-12-03 16:39:30,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 16:39:30,418 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 107 [2018-12-03 16:39:30,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:30,419 INFO L225 Difference]: With dead ends: 144 [2018-12-03 16:39:30,419 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 16:39:30,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:39:30,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 16:39:30,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2018-12-03 16:39:30,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 16:39:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2018-12-03 16:39:30,425 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 107 [2018-12-03 16:39:30,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:30,425 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2018-12-03 16:39:30,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 16:39:30,425 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2018-12-03 16:39:30,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 16:39:30,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:30,426 INFO L402 BasicCegarLoop]: trace histogram [54, 39, 15, 1, 1, 1] [2018-12-03 16:39:30,426 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:30,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:30,427 INFO L82 PathProgramCache]: Analyzing trace with hash 404266139, now seen corresponding path program 39 times [2018-12-03 16:39:30,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:30,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:30,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:30,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:30,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 16:39:31,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:31,264 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:31,264 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:31,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:31,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:31,264 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:31,272 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:31,272 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:31,307 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:31,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:31,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:31,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 16:39:31,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:33,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 16:39:33,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:33,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 51 [2018-12-03 16:39:33,330 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:33,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 16:39:33,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 16:39:33,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:33,331 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand 42 states. [2018-12-03 16:39:33,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:33,723 INFO L93 Difference]: Finished difference Result 147 states and 178 transitions. [2018-12-03 16:39:33,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 16:39:33,724 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 111 [2018-12-03 16:39:33,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:33,725 INFO L225 Difference]: With dead ends: 147 [2018-12-03 16:39:33,725 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 16:39:33,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 181 SyntacticMatches, 30 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:33,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 16:39:33,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 16:39:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 16:39:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2018-12-03 16:39:33,731 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 111 [2018-12-03 16:39:33,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:33,732 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2018-12-03 16:39:33,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 16:39:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-12-03 16:39:33,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 16:39:33,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:33,732 INFO L402 BasicCegarLoop]: trace histogram [55, 40, 15, 1, 1, 1] [2018-12-03 16:39:33,733 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:33,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:33,733 INFO L82 PathProgramCache]: Analyzing trace with hash 2025155970, now seen corresponding path program 40 times [2018-12-03 16:39:33,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:33,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:33,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:33,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:33,734 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:35,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 16:39:35,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:35,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:35,162 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:35,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:35,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:35,162 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:35,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:35,172 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:35,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 16:39:35,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:36,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 16:39:36,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:36,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 51 [2018-12-03 16:39:36,185 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:36,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 16:39:36,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 16:39:36,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:36,186 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 43 states. [2018-12-03 16:39:36,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:36,893 INFO L93 Difference]: Finished difference Result 149 states and 180 transitions. [2018-12-03 16:39:36,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 16:39:36,894 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 113 [2018-12-03 16:39:36,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:36,895 INFO L225 Difference]: With dead ends: 149 [2018-12-03 16:39:36,895 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 16:39:36,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 184 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:36,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 16:39:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 16:39:36,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 16:39:36,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2018-12-03 16:39:36,901 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 113 [2018-12-03 16:39:36,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:36,901 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2018-12-03 16:39:36,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 16:39:36,901 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2018-12-03 16:39:36,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 16:39:36,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:36,902 INFO L402 BasicCegarLoop]: trace histogram [56, 41, 15, 1, 1, 1] [2018-12-03 16:39:36,902 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:36,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:36,902 INFO L82 PathProgramCache]: Analyzing trace with hash 627155113, now seen corresponding path program 41 times [2018-12-03 16:39:36,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:36,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:36,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:36,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:36,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1218 proven. 1722 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 16:39:37,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:37,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:37,662 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:37,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:37,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:37,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:37,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:37,670 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:37,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 16:39:37,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:37,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:38,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-12-03 16:39:38,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-12-03 16:39:39,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:39,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 18, 18] total 76 [2018-12-03 16:39:39,364 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:39,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 16:39:39,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 16:39:39,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:39:39,366 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand 60 states. [2018-12-03 16:39:39,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:39,652 INFO L93 Difference]: Finished difference Result 154 states and 188 transitions. [2018-12-03 16:39:39,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 16:39:39,653 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 115 [2018-12-03 16:39:39,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:39,654 INFO L225 Difference]: With dead ends: 154 [2018-12-03 16:39:39,654 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 16:39:39,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:39:39,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 16:39:39,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-12-03 16:39:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 16:39:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2018-12-03 16:39:39,661 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 115 [2018-12-03 16:39:39,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:39,662 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2018-12-03 16:39:39,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 16:39:39,662 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2018-12-03 16:39:39,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 16:39:39,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:39,663 INFO L402 BasicCegarLoop]: trace histogram [58, 42, 16, 1, 1, 1] [2018-12-03 16:39:39,663 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:39,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:39,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1694669383, now seen corresponding path program 42 times [2018-12-03 16:39:39,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:39,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:39,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:39,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:39,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:40,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 16:39:40,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:40,442 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:40,442 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:40,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:40,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:40,442 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:40,451 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:40,451 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:40,487 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:40,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:40,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 16:39:40,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:41,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 16:39:41,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:41,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 51 [2018-12-03 16:39:41,537 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:41,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 16:39:41,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 16:39:41,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:41,540 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand 45 states. [2018-12-03 16:39:41,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:41,852 INFO L93 Difference]: Finished difference Result 157 states and 190 transitions. [2018-12-03 16:39:41,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:39:41,853 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 119 [2018-12-03 16:39:41,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:41,854 INFO L225 Difference]: With dead ends: 157 [2018-12-03 16:39:41,854 INFO L226 Difference]: Without dead ends: 122 [2018-12-03 16:39:41,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 194 SyntacticMatches, 36 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:41,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-03 16:39:41,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-12-03 16:39:41,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 16:39:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-12-03 16:39:41,862 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 119 [2018-12-03 16:39:41,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:41,862 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-12-03 16:39:41,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 16:39:41,863 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-12-03 16:39:41,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 16:39:41,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:41,863 INFO L402 BasicCegarLoop]: trace histogram [59, 43, 16, 1, 1, 1] [2018-12-03 16:39:41,864 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:41,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:41,864 INFO L82 PathProgramCache]: Analyzing trace with hash 59400096, now seen corresponding path program 43 times [2018-12-03 16:39:41,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:41,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:41,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:41,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:41,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 16:39:42,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:42,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:42,836 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:42,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:42,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:42,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:42,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:42,845 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:42,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:42,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 16:39:42,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:44,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 16:39:44,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:44,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 51 [2018-12-03 16:39:44,472 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:44,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:39:44,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:39:44,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:44,473 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 46 states. [2018-12-03 16:39:44,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:44,631 INFO L93 Difference]: Finished difference Result 159 states and 192 transitions. [2018-12-03 16:39:44,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 16:39:44,631 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 121 [2018-12-03 16:39:44,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:44,632 INFO L225 Difference]: With dead ends: 159 [2018-12-03 16:39:44,632 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 16:39:44,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 197 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:44,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 16:39:44,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 16:39:44,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 16:39:44,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2018-12-03 16:39:44,638 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 121 [2018-12-03 16:39:44,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:44,638 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2018-12-03 16:39:44,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:39:44,639 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2018-12-03 16:39:44,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 16:39:44,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:44,639 INFO L402 BasicCegarLoop]: trace histogram [60, 44, 16, 1, 1, 1] [2018-12-03 16:39:44,640 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:44,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:44,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2092989383, now seen corresponding path program 44 times [2018-12-03 16:39:44,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:44,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:44,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:44,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:44,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:45,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1395 proven. 1980 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 16:39:45,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:45,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:45,499 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:45,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:45,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:45,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:45,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:45,510 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:45,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 16:39:45,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:45,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-12-03 16:39:46,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:47,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-12-03 16:39:47,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:47,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 19, 19] total 81 [2018-12-03 16:39:47,218 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:47,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 16:39:47,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 16:39:47,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 16:39:47,219 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand 64 states. [2018-12-03 16:39:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:47,676 INFO L93 Difference]: Finished difference Result 164 states and 200 transitions. [2018-12-03 16:39:47,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 16:39:47,676 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 123 [2018-12-03 16:39:47,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:47,678 INFO L225 Difference]: With dead ends: 164 [2018-12-03 16:39:47,678 INFO L226 Difference]: Without dead ends: 129 [2018-12-03 16:39:47,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 16:39:47,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-03 16:39:47,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2018-12-03 16:39:47,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 16:39:47,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 145 transitions. [2018-12-03 16:39:47,686 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 145 transitions. Word has length 123 [2018-12-03 16:39:47,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:47,687 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 145 transitions. [2018-12-03 16:39:47,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 16:39:47,687 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2018-12-03 16:39:47,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 16:39:47,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:47,688 INFO L402 BasicCegarLoop]: trace histogram [62, 45, 17, 1, 1, 1] [2018-12-03 16:39:47,688 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:47,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:47,688 INFO L82 PathProgramCache]: Analyzing trace with hash -914400681, now seen corresponding path program 45 times [2018-12-03 16:39:47,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:47,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:47,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:47,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:47,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 16:39:48,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:48,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:48,652 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:48,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:48,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:48,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:48,660 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:48,660 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:48,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:48,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:48,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:48,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 16:39:48,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 16:39:49,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:49,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 51 [2018-12-03 16:39:49,909 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:49,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:39:49,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:39:49,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:49,910 INFO L87 Difference]: Start difference. First operand 128 states and 145 transitions. Second operand 48 states. [2018-12-03 16:39:50,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:50,087 INFO L93 Difference]: Finished difference Result 167 states and 202 transitions. [2018-12-03 16:39:50,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:39:50,088 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 127 [2018-12-03 16:39:50,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:50,089 INFO L225 Difference]: With dead ends: 167 [2018-12-03 16:39:50,089 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 16:39:50,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 207 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:50,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 16:39:50,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-03 16:39:50,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 16:39:50,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2018-12-03 16:39:50,095 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 127 [2018-12-03 16:39:50,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:50,095 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2018-12-03 16:39:50,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:39:50,095 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2018-12-03 16:39:50,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 16:39:50,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:50,096 INFO L402 BasicCegarLoop]: trace histogram [63, 46, 17, 1, 1, 1] [2018-12-03 16:39:50,096 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:50,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:50,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1069776190, now seen corresponding path program 46 times [2018-12-03 16:39:50,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:50,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:50,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:50,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:50,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:51,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 16:39:51,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:51,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:51,021 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:51,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:51,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:51,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:51,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:51,029 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:39:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:51,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:51,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 16:39:51,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:52,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 16:39:52,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:52,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 51 [2018-12-03 16:39:52,105 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:52,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 16:39:52,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 16:39:52,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:52,106 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand 49 states. [2018-12-03 16:39:52,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:52,326 INFO L93 Difference]: Finished difference Result 169 states and 204 transitions. [2018-12-03 16:39:52,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:39:52,327 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 129 [2018-12-03 16:39:52,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:52,328 INFO L225 Difference]: With dead ends: 169 [2018-12-03 16:39:52,328 INFO L226 Difference]: Without dead ends: 132 [2018-12-03 16:39:52,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 210 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:52,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-03 16:39:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-12-03 16:39:52,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 16:39:52,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2018-12-03 16:39:52,336 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 129 [2018-12-03 16:39:52,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:52,336 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2018-12-03 16:39:52,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 16:39:52,336 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2018-12-03 16:39:52,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 16:39:52,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:52,337 INFO L402 BasicCegarLoop]: trace histogram [64, 47, 17, 1, 1, 1] [2018-12-03 16:39:52,337 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:52,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:52,338 INFO L82 PathProgramCache]: Analyzing trace with hash 898269797, now seen corresponding path program 47 times [2018-12-03 16:39:52,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:52,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:52,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:39:52,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:52,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:53,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1584 proven. 2256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 16:39:53,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:53,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:53,471 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:53,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:53,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:53,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:53,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:39:53,480 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:39:53,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 16:39:53,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:53,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:54,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-12-03 16:39:54,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-12-03 16:39:55,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:55,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 20, 20] total 86 [2018-12-03 16:39:55,557 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:55,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 16:39:55,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 16:39:55,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:39:55,558 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand 68 states. [2018-12-03 16:39:56,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:56,127 INFO L93 Difference]: Finished difference Result 174 states and 212 transitions. [2018-12-03 16:39:56,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 16:39:56,127 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 131 [2018-12-03 16:39:56,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:56,129 INFO L225 Difference]: With dead ends: 174 [2018-12-03 16:39:56,129 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 16:39:56,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:39:56,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 16:39:56,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-12-03 16:39:56,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 16:39:56,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 154 transitions. [2018-12-03 16:39:56,137 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 154 transitions. Word has length 131 [2018-12-03 16:39:56,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:56,137 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 154 transitions. [2018-12-03 16:39:56,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 16:39:56,137 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 154 transitions. [2018-12-03 16:39:56,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 16:39:56,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:56,138 INFO L402 BasicCegarLoop]: trace histogram [66, 48, 18, 1, 1, 1] [2018-12-03 16:39:56,138 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:56,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:56,139 INFO L82 PathProgramCache]: Analyzing trace with hash -2712971, now seen corresponding path program 48 times [2018-12-03 16:39:56,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:56,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:56,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:56,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:56,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:39:58,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 16:39:58,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:58,162 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:39:58,163 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:39:58,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:39:58,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:39:58,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:39:58,171 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:39:58,172 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:39:58,221 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:39:58,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:39:58,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:39:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 16:39:58,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:39:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 16:39:59,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:39:59,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 51 [2018-12-03 16:39:59,163 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:39:59,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 16:39:59,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 16:39:59,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:59,164 INFO L87 Difference]: Start difference. First operand 136 states and 154 transitions. Second operand 51 states. [2018-12-03 16:39:59,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:39:59,402 INFO L93 Difference]: Finished difference Result 177 states and 214 transitions. [2018-12-03 16:39:59,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 16:39:59,403 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 135 [2018-12-03 16:39:59,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:39:59,403 INFO L225 Difference]: With dead ends: 177 [2018-12-03 16:39:59,403 INFO L226 Difference]: Without dead ends: 138 [2018-12-03 16:39:59,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 220 SyntacticMatches, 48 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:39:59,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-03 16:39:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-03 16:39:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 16:39:59,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 156 transitions. [2018-12-03 16:39:59,409 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 156 transitions. Word has length 135 [2018-12-03 16:39:59,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:39:59,409 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 156 transitions. [2018-12-03 16:39:59,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 16:39:59,409 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 156 transitions. [2018-12-03 16:39:59,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 16:39:59,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:39:59,410 INFO L402 BasicCegarLoop]: trace histogram [67, 49, 18, 1, 1, 1] [2018-12-03 16:39:59,410 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:39:59,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:39:59,410 INFO L82 PathProgramCache]: Analyzing trace with hash -761731492, now seen corresponding path program 49 times [2018-12-03 16:39:59,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:39:59,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:59,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:39:59,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:39:59,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:39:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:00,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 16:40:00,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:00,751 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:00,751 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:00,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:00,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:00,751 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:00,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:00,760 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:40:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:00,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 16:40:00,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 16:40:02,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:02,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-12-03 16:40:02,949 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:02,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:40:02,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:40:02,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:40:02,950 INFO L87 Difference]: Start difference. First operand 138 states and 156 transitions. Second operand 52 states. [2018-12-03 16:40:03,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:03,143 INFO L93 Difference]: Finished difference Result 179 states and 216 transitions. [2018-12-03 16:40:03,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:40:03,143 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 137 [2018-12-03 16:40:03,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:03,145 INFO L225 Difference]: With dead ends: 179 [2018-12-03 16:40:03,145 INFO L226 Difference]: Without dead ends: 140 [2018-12-03 16:40:03,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 223 SyntacticMatches, 50 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:40:03,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-03 16:40:03,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-03 16:40:03,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-03 16:40:03,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 158 transitions. [2018-12-03 16:40:03,152 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 158 transitions. Word has length 137 [2018-12-03 16:40:03,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:03,152 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 158 transitions. [2018-12-03 16:40:03,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:40:03,152 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 158 transitions. [2018-12-03 16:40:03,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 16:40:03,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:03,153 INFO L402 BasicCegarLoop]: trace histogram [68, 50, 18, 1, 1, 1] [2018-12-03 16:40:03,153 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:03,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:03,154 INFO L82 PathProgramCache]: Analyzing trace with hash -34089853, now seen corresponding path program 50 times [2018-12-03 16:40:03,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:03,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:03,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:03,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:03,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:04,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1968 proven. 400 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 16:40:04,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:04,320 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:04,321 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:04,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:04,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:04,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:04,330 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:40:04,331 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:40:04,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 16:40:04,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:04,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 16:40:04,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 16:40:05,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:05,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 42 [2018-12-03 16:40:05,154 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:05,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:40:05,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:40:05,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:40:05,155 INFO L87 Difference]: Start difference. First operand 140 states and 158 transitions. Second operand 23 states. [2018-12-03 16:40:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:05,251 INFO L93 Difference]: Finished difference Result 149 states and 173 transitions. [2018-12-03 16:40:05,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:40:05,252 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 139 [2018-12-03 16:40:05,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:05,253 INFO L225 Difference]: With dead ends: 149 [2018-12-03 16:40:05,253 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 16:40:05,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:40:05,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 16:40:05,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-12-03 16:40:05,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 16:40:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 167 transitions. [2018-12-03 16:40:05,261 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 167 transitions. Word has length 139 [2018-12-03 16:40:05,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:05,262 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 167 transitions. [2018-12-03 16:40:05,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:40:05,262 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 167 transitions. [2018-12-03 16:40:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 16:40:05,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:05,263 INFO L402 BasicCegarLoop]: trace histogram [71, 50, 21, 1, 1, 1] [2018-12-03 16:40:05,263 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:05,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:05,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1920855678, now seen corresponding path program 51 times [2018-12-03 16:40:05,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:05,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:05,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:05,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:05,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:07,031 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2256 proven. 529 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 16:40:07,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:07,032 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:07,032 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:07,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:07,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:07,032 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:07,040 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:40:07,040 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:40:07,085 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:40:07,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:07,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:08,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:10,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:10,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 73, 73] total 102 [2018-12-03 16:40:10,995 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:10,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 16:40:10,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 16:40:10,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:40:10,996 INFO L87 Difference]: Start difference. First operand 146 states and 167 transitions. Second operand 76 states. [2018-12-03 16:40:11,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:11,400 INFO L93 Difference]: Finished difference Result 155 states and 182 transitions. [2018-12-03 16:40:11,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 16:40:11,401 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 145 [2018-12-03 16:40:11,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:11,402 INFO L225 Difference]: With dead ends: 155 [2018-12-03 16:40:11,402 INFO L226 Difference]: Without dead ends: 153 [2018-12-03 16:40:11,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 168 SyntacticMatches, 46 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10537 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:40:11,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-03 16:40:11,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2018-12-03 16:40:11,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-03 16:40:11,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 176 transitions. [2018-12-03 16:40:11,407 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 176 transitions. Word has length 145 [2018-12-03 16:40:11,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:11,407 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 176 transitions. [2018-12-03 16:40:11,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 16:40:11,408 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 176 transitions. [2018-12-03 16:40:11,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-03 16:40:11,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:11,409 INFO L402 BasicCegarLoop]: trace histogram [74, 50, 24, 1, 1, 1] [2018-12-03 16:40:11,409 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:11,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:11,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1141465145, now seen corresponding path program 52 times [2018-12-03 16:40:11,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:11,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:11,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:11,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:11,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:12,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2544 proven. 676 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 16:40:12,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:12,607 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:12,607 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:12,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:12,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:12,607 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:12,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:12,617 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:40:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:12,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:13,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:15,763 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:15,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:15,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 76, 76] total 102 [2018-12-03 16:40:15,782 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:15,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 16:40:15,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 16:40:15,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:40:15,783 INFO L87 Difference]: Start difference. First operand 152 states and 176 transitions. Second operand 79 states. [2018-12-03 16:40:16,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:16,326 INFO L93 Difference]: Finished difference Result 161 states and 191 transitions. [2018-12-03 16:40:16,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 16:40:16,327 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 151 [2018-12-03 16:40:16,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:16,328 INFO L225 Difference]: With dead ends: 161 [2018-12-03 16:40:16,328 INFO L226 Difference]: Without dead ends: 159 [2018-12-03 16:40:16,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 177 SyntacticMatches, 52 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11272 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:40:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-03 16:40:16,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2018-12-03 16:40:16,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 16:40:16,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 185 transitions. [2018-12-03 16:40:16,334 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 185 transitions. Word has length 151 [2018-12-03 16:40:16,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:16,335 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 185 transitions. [2018-12-03 16:40:16,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 16:40:16,335 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 185 transitions. [2018-12-03 16:40:16,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-03 16:40:16,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:16,336 INFO L402 BasicCegarLoop]: trace histogram [77, 50, 27, 1, 1, 1] [2018-12-03 16:40:16,336 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:16,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:16,336 INFO L82 PathProgramCache]: Analyzing trace with hash -978757196, now seen corresponding path program 53 times [2018-12-03 16:40:16,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:16,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:16,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:16,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:16,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2832 proven. 841 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 16:40:16,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:16,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:16,895 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:16,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:16,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:16,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:16,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:40:16,903 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:40:16,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 16:40:16,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:16,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:17,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 16:40:17,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:17,816 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 16:40:17,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:17,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 52 [2018-12-03 16:40:17,835 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:17,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 16:40:17,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 16:40:17,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:40:17,836 INFO L87 Difference]: Start difference. First operand 158 states and 185 transitions. Second operand 32 states. [2018-12-03 16:40:17,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:17,982 INFO L93 Difference]: Finished difference Result 167 states and 200 transitions. [2018-12-03 16:40:17,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:40:17,982 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 157 [2018-12-03 16:40:17,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:17,983 INFO L225 Difference]: With dead ends: 167 [2018-12-03 16:40:17,983 INFO L226 Difference]: Without dead ends: 165 [2018-12-03 16:40:17,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 286 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:40:17,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-03 16:40:17,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2018-12-03 16:40:17,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-03 16:40:17,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 194 transitions. [2018-12-03 16:40:17,988 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 194 transitions. Word has length 157 [2018-12-03 16:40:17,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:17,989 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 194 transitions. [2018-12-03 16:40:17,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 16:40:17,989 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 194 transitions. [2018-12-03 16:40:17,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-03 16:40:17,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:17,990 INFO L402 BasicCegarLoop]: trace histogram [80, 50, 30, 1, 1, 1] [2018-12-03 16:40:17,990 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:17,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:17,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1370944785, now seen corresponding path program 54 times [2018-12-03 16:40:17,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:17,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:17,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:17,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:17,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3120 proven. 1024 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 16:40:18,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:18,997 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:18,997 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:18,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:18,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:18,997 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:19,008 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:40:19,009 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:40:19,073 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:40:19,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:19,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:20,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:20,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:22,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:22,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:22,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 82, 82] total 102 [2018-12-03 16:40:22,077 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:22,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 16:40:22,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 16:40:22,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:40:22,078 INFO L87 Difference]: Start difference. First operand 164 states and 194 transitions. Second operand 85 states. [2018-12-03 16:40:22,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:22,675 INFO L93 Difference]: Finished difference Result 173 states and 209 transitions. [2018-12-03 16:40:22,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 16:40:22,676 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 163 [2018-12-03 16:40:22,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:22,677 INFO L225 Difference]: With dead ends: 173 [2018-12-03 16:40:22,677 INFO L226 Difference]: Without dead ends: 171 [2018-12-03 16:40:22,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 195 SyntacticMatches, 64 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12742 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:40:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-03 16:40:22,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2018-12-03 16:40:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-12-03 16:40:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2018-12-03 16:40:22,682 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 163 [2018-12-03 16:40:22,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:22,682 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2018-12-03 16:40:22,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 16:40:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2018-12-03 16:40:22,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-03 16:40:22,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:22,683 INFO L402 BasicCegarLoop]: trace histogram [83, 50, 33, 1, 1, 1] [2018-12-03 16:40:22,683 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:22,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:22,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1011899414, now seen corresponding path program 55 times [2018-12-03 16:40:22,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:22,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:22,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:22,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:22,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3408 proven. 1225 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 16:40:23,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:23,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:23,454 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:23,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:23,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:23,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:23,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:23,463 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:40:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:23,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:24,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:24,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:26,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:26,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:26,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 85, 85] total 102 [2018-12-03 16:40:26,741 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:26,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 16:40:26,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 16:40:26,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:40:26,742 INFO L87 Difference]: Start difference. First operand 170 states and 203 transitions. Second operand 88 states. [2018-12-03 16:40:27,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:27,461 INFO L93 Difference]: Finished difference Result 179 states and 218 transitions. [2018-12-03 16:40:27,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 16:40:27,462 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 169 [2018-12-03 16:40:27,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:27,463 INFO L225 Difference]: With dead ends: 179 [2018-12-03 16:40:27,463 INFO L226 Difference]: Without dead ends: 177 [2018-12-03 16:40:27,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 204 SyntacticMatches, 70 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13477 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:40:27,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-03 16:40:27,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2018-12-03 16:40:27,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-03 16:40:27,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 212 transitions. [2018-12-03 16:40:27,470 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 212 transitions. Word has length 169 [2018-12-03 16:40:27,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:27,470 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 212 transitions. [2018-12-03 16:40:27,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 16:40:27,470 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 212 transitions. [2018-12-03 16:40:27,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-03 16:40:27,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:27,471 INFO L402 BasicCegarLoop]: trace histogram [86, 50, 36, 1, 1, 1] [2018-12-03 16:40:27,471 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:27,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:27,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1166038181, now seen corresponding path program 56 times [2018-12-03 16:40:27,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:27,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:27,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:27,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:27,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:28,173 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3696 proven. 1444 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 16:40:28,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:28,173 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:28,173 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:28,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:28,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:28,174 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:28,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:40:28,182 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:40:28,273 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 74 check-sat command(s) [2018-12-03 16:40:28,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:28,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 16:40:28,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:29,276 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 16:40:29,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:29,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 39, 39] total 52 [2018-12-03 16:40:29,295 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:29,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 16:40:29,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 16:40:29,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:40:29,296 INFO L87 Difference]: Start difference. First operand 176 states and 212 transitions. Second operand 41 states. [2018-12-03 16:40:29,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:29,507 INFO L93 Difference]: Finished difference Result 185 states and 227 transitions. [2018-12-03 16:40:29,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 16:40:29,507 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 175 [2018-12-03 16:40:29,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:29,508 INFO L225 Difference]: With dead ends: 185 [2018-12-03 16:40:29,508 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 16:40:29,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 313 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:40:29,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 16:40:29,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-12-03 16:40:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-03 16:40:29,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 221 transitions. [2018-12-03 16:40:29,516 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 221 transitions. Word has length 175 [2018-12-03 16:40:29,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:29,516 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 221 transitions. [2018-12-03 16:40:29,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 16:40:29,516 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 221 transitions. [2018-12-03 16:40:29,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-03 16:40:29,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:29,517 INFO L402 BasicCegarLoop]: trace histogram [89, 50, 39, 1, 1, 1] [2018-12-03 16:40:29,518 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:29,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:29,518 INFO L82 PathProgramCache]: Analyzing trace with hash 406474016, now seen corresponding path program 57 times [2018-12-03 16:40:29,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:29,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:29,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:29,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:29,519 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:30,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 3984 proven. 1681 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 16:40:30,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:30,561 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:30,561 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:30,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:30,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:30,561 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:30,571 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:40:30,571 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:40:30,628 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:40:30,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:30,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:31,644 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:31,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:33,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:33,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:33,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 91, 91] total 102 [2018-12-03 16:40:33,469 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:33,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 16:40:33,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 16:40:33,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:40:33,471 INFO L87 Difference]: Start difference. First operand 182 states and 221 transitions. Second operand 94 states. [2018-12-03 16:40:34,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:34,228 INFO L93 Difference]: Finished difference Result 191 states and 236 transitions. [2018-12-03 16:40:34,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 16:40:34,228 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 181 [2018-12-03 16:40:34,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:34,229 INFO L225 Difference]: With dead ends: 191 [2018-12-03 16:40:34,229 INFO L226 Difference]: Without dead ends: 189 [2018-12-03 16:40:34,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 222 SyntacticMatches, 82 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14947 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:40:34,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-03 16:40:34,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2018-12-03 16:40:34,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-03 16:40:34,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 230 transitions. [2018-12-03 16:40:34,237 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 230 transitions. Word has length 181 [2018-12-03 16:40:34,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:34,238 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 230 transitions. [2018-12-03 16:40:34,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 16:40:34,238 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 230 transitions. [2018-12-03 16:40:34,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-03 16:40:34,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:34,239 INFO L402 BasicCegarLoop]: trace histogram [92, 50, 42, 1, 1, 1] [2018-12-03 16:40:34,239 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:34,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:34,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1338458789, now seen corresponding path program 58 times [2018-12-03 16:40:34,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:34,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:34,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:34,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:34,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:35,565 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4272 proven. 1936 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 16:40:35,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:35,565 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:35,565 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:35,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:35,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:35,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:35,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:35,576 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:40:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:35,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:36,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:38,741 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:38,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:38,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 94, 94] total 102 [2018-12-03 16:40:38,760 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:38,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 16:40:38,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 16:40:38,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:40:38,762 INFO L87 Difference]: Start difference. First operand 188 states and 230 transitions. Second operand 97 states. [2018-12-03 16:40:39,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:39,665 INFO L93 Difference]: Finished difference Result 197 states and 245 transitions. [2018-12-03 16:40:39,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 16:40:39,665 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 187 [2018-12-03 16:40:39,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:39,666 INFO L225 Difference]: With dead ends: 197 [2018-12-03 16:40:39,666 INFO L226 Difference]: Without dead ends: 195 [2018-12-03 16:40:39,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 231 SyntacticMatches, 88 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15682 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:40:39,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-03 16:40:39,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2018-12-03 16:40:39,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 16:40:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 239 transitions. [2018-12-03 16:40:39,673 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 239 transitions. Word has length 187 [2018-12-03 16:40:39,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:39,674 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 239 transitions. [2018-12-03 16:40:39,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 16:40:39,674 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 239 transitions. [2018-12-03 16:40:39,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-03 16:40:39,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:39,675 INFO L402 BasicCegarLoop]: trace histogram [95, 50, 45, 1, 1, 1] [2018-12-03 16:40:39,675 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:39,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:39,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1129130666, now seen corresponding path program 59 times [2018-12-03 16:40:39,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:39,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:39,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:39,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:39,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4560 proven. 2209 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 16:40:41,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:41,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:41,015 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:41,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:41,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:41,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:41,024 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:40:41,024 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:40:41,151 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 92 check-sat command(s) [2018-12-03 16:40:41,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:41,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 16:40:41,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:42,105 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 16:40:42,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:42,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 48, 48] total 52 [2018-12-03 16:40:42,125 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:42,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 16:40:42,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 16:40:42,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:40:42,126 INFO L87 Difference]: Start difference. First operand 194 states and 239 transitions. Second operand 50 states. [2018-12-03 16:40:42,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:42,459 INFO L93 Difference]: Finished difference Result 203 states and 254 transitions. [2018-12-03 16:40:42,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 16:40:42,460 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 193 [2018-12-03 16:40:42,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:42,461 INFO L225 Difference]: With dead ends: 203 [2018-12-03 16:40:42,461 INFO L226 Difference]: Without dead ends: 201 [2018-12-03 16:40:42,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 340 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:40:42,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-03 16:40:42,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2018-12-03 16:40:42,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-03 16:40:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 248 transitions. [2018-12-03 16:40:42,468 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 248 transitions. Word has length 193 [2018-12-03 16:40:42,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:42,468 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 248 transitions. [2018-12-03 16:40:42,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 16:40:42,468 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 248 transitions. [2018-12-03 16:40:42,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-03 16:40:42,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:42,469 INFO L402 BasicCegarLoop]: trace histogram [98, 50, 48, 1, 1, 1] [2018-12-03 16:40:42,470 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:42,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:42,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1833188079, now seen corresponding path program 60 times [2018-12-03 16:40:42,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:42,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:42,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:42,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:42,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:43,480 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 4850 proven. 2304 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 16:40:43,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:43,481 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:43,481 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:43,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:43,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:43,481 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:43,489 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:40:43,490 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:40:43,547 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:40:43,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:43,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:44,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:46,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:46,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 100, 100] total 102 [2018-12-03 16:40:46,844 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:46,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 16:40:46,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 16:40:46,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:40:46,845 INFO L87 Difference]: Start difference. First operand 200 states and 248 transitions. Second operand 101 states. [2018-12-03 16:40:47,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:47,852 INFO L93 Difference]: Finished difference Result 205 states and 255 transitions. [2018-12-03 16:40:47,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 16:40:47,852 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 199 [2018-12-03 16:40:47,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:47,853 INFO L225 Difference]: With dead ends: 205 [2018-12-03 16:40:47,853 INFO L226 Difference]: Without dead ends: 203 [2018-12-03 16:40:47,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 249 SyntacticMatches, 98 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16953 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:40:47,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-03 16:40:47,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2018-12-03 16:40:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 16:40:47,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 251 transitions. [2018-12-03 16:40:47,861 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 251 transitions. Word has length 199 [2018-12-03 16:40:47,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:47,861 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 251 transitions. [2018-12-03 16:40:47,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 16:40:47,861 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 251 transitions. [2018-12-03 16:40:47,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-03 16:40:47,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:47,862 INFO L402 BasicCegarLoop]: trace histogram [99, 50, 49, 1, 1, 1] [2018-12-03 16:40:47,863 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:47,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:47,863 INFO L82 PathProgramCache]: Analyzing trace with hash -757086086, now seen corresponding path program 61 times [2018-12-03 16:40:47,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:47,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:47,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:47,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:47,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:48,887 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 2401 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 16:40:48,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:48,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:48,888 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:48,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:48,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:48,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:48,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:48,898 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:40:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:48,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:50,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:50,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:52,494 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:40:52,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:52,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 101, 101] total 102 [2018-12-03 16:40:52,513 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:52,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 16:40:52,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 16:40:52,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:40:52,515 INFO L87 Difference]: Start difference. First operand 202 states and 251 transitions. Second operand 102 states. [2018-12-03 16:40:53,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:53,396 INFO L93 Difference]: Finished difference Result 206 states and 256 transitions. [2018-12-03 16:40:53,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 16:40:53,396 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 201 [2018-12-03 16:40:53,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:53,397 INFO L225 Difference]: With dead ends: 206 [2018-12-03 16:40:53,397 INFO L226 Difference]: Without dead ends: 204 [2018-12-03 16:40:53,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 252 SyntacticMatches, 100 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17200 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:40:53,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-03 16:40:53,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-12-03 16:40:53,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-12-03 16:40:53,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 254 transitions. [2018-12-03 16:40:53,405 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 254 transitions. Word has length 201 [2018-12-03 16:40:53,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:53,406 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 254 transitions. [2018-12-03 16:40:53,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 16:40:53,406 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 254 transitions. [2018-12-03 16:40:53,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-03 16:40:53,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:53,407 INFO L402 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1] [2018-12-03 16:40:53,407 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:53,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:53,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1710189149, now seen corresponding path program 62 times [2018-12-03 16:40:53,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:53,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:53,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:40:53,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:53,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:40:55,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 16:40:55,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:55,098 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:40:55,098 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:40:55,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:40:55,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:40:55,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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:40:55,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:40:55,109 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:40:55,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2018-12-03 16:40:55,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:40:55,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:40:56,456 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 16:40:56,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:40:56,733 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 16:40:56,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:40:56,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2018-12-03 16:40:56,760 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:40:56,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 16:40:56,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 16:40:56,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:40:56,761 INFO L87 Difference]: Start difference. First operand 204 states and 254 transitions. Second operand 53 states. [2018-12-03 16:40:58,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:40:58,868 INFO L93 Difference]: Finished difference Result 2857 states and 4232 transitions. [2018-12-03 16:40:58,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 16:40:58,868 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 203 [2018-12-03 16:40:58,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:40:58,878 INFO L225 Difference]: With dead ends: 2857 [2018-12-03 16:40:58,878 INFO L226 Difference]: Without dead ends: 2855 [2018-12-03 16:40:58,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 401 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:40:58,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2018-12-03 16:40:58,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 206. [2018-12-03 16:40:58,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-03 16:40:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 257 transitions. [2018-12-03 16:40:58,985 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 257 transitions. Word has length 203 [2018-12-03 16:40:58,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:40:58,986 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 257 transitions. [2018-12-03 16:40:58,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 16:40:58,986 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 257 transitions. [2018-12-03 16:40:58,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-12-03 16:40:58,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:40:58,988 INFO L402 BasicCegarLoop]: trace histogram [101, 51, 50, 1, 1, 1] [2018-12-03 16:40:58,988 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:40:58,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:40:58,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1480768652, now seen corresponding path program 63 times [2018-12-03 16:40:58,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:40:58,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:58,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:40:58,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:40:58,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:40:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:00,628 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 7651 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 16:41:00,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:41:00,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-12-03 16:41:00,628 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:41:00,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:41:00,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:41:00,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:41:00,630 INFO L87 Difference]: Start difference. First operand 206 states and 257 transitions. Second operand 52 states. [2018-12-03 16:41:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:01,159 INFO L93 Difference]: Finished difference Result 305 states and 405 transitions. [2018-12-03 16:41:01,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:41:01,159 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 205 [2018-12-03 16:41:01,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:01,160 INFO L225 Difference]: With dead ends: 305 [2018-12-03 16:41:01,160 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:41:01,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:41:01,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:41:01,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:41:01,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:41:01,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:41:01,162 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 205 [2018-12-03 16:41:01,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:01,162 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:41:01,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:41:01,163 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:41:01,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:41:01,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:41:01,887 WARN L180 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 1832 DAG size of output: 407 [2018-12-03 16:41:02,519 WARN L180 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 1827 DAG size of output: 400 [2018-12-03 16:41:08,945 WARN L180 SmtUtils]: Spent 6.42 s on a formula simplification. DAG size of input: 407 DAG size of output: 357 [2018-12-03 16:41:10,583 WARN L180 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 400 DAG size of output: 351 [2018-12-03 16:41:10,588 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 43) no Hoare annotation was computed. [2018-12-03 16:41:10,589 INFO L444 ceAbstractionStarter]: At program point L32(lines 29 38) the Hoare annotation is: (or (and (and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 96)) (<= 96 ULTIMATE.start_main_~x~4)) (and (<= 79 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 79))) (and (and (<= ULTIMATE.start_main_~y~4 97) (<= ULTIMATE.start_main_~x~4 97) (<= 97 ULTIMATE.start_main_~y~4)) (<= 97 ULTIMATE.start_main_~x~4)) (and (and (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95) (<= ULTIMATE.start_main_~x~4 95)) (<= 95 ULTIMATE.start_main_~x~4)) (and (and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 91) (<= ULTIMATE.start_main_~y~4 91)) (<= 91 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 72) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)) (<= 72 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62)) (<= 62 ULTIMATE.start_main_~x~4)) (and (<= 54 ULTIMATE.start_main_~x~4) (and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 54) (<= ULTIMATE.start_main_~y~4 54))) (and (<= 60 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 60) (<= ULTIMATE.start_main_~x~4 60) (<= 60 ULTIMATE.start_main_~y~4))) (and (<= 98 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 98) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4))) (and (and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= ULTIMATE.start_main_~x~4 88)) (<= 88 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 73)) (<= 73 ULTIMATE.start_main_~x~4)) (and (<= 64 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64))) (and (and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76)) (<= 76 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 84) (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~y~4)) (<= 84 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 85)) (<= 85 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61)) (<= 61 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 59) (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4)) (<= 59 ULTIMATE.start_main_~x~4)) (and (<= 69 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 69) (<= ULTIMATE.start_main_~x~4 69) (<= 69 ULTIMATE.start_main_~y~4))) (and (and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= ULTIMATE.start_main_~x~4 55)) (<= 55 ULTIMATE.start_main_~x~4)) (and (and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= ULTIMATE.start_main_~x~4 99)) (<= 99 ULTIMATE.start_main_~x~4)) (and (<= 53 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4))) (and (<= 77 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 77) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4))) (and (<= 89 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 89) (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~y~4))) (and (<= 94 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 94) (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 93)) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= 68 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 68) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 81) (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~y~4)) (<= 81 ULTIMATE.start_main_~x~4)) (and (and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= ULTIMATE.start_main_~x~4 57)) (<= 57 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)) (<= 82 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4)) (<= 58 ULTIMATE.start_main_~x~4)) (and (<= 78 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 78))) (and (and (<= ULTIMATE.start_main_~y~4 65) (<= ULTIMATE.start_main_~x~4 65) (<= 65 ULTIMATE.start_main_~y~4)) (<= 65 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 90)) (<= 90 ULTIMATE.start_main_~x~4)) (and (<= 63 ULTIMATE.start_main_~x~4) (and (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63) (<= ULTIMATE.start_main_~x~4 63))) (and (<= 51 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 51))) (and (<= 52 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52))) (and (and (<= 74 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 74) (<= ULTIMATE.start_main_~y~4 74)) (<= 74 ULTIMATE.start_main_~x~4)) (and (<= 86 ULTIMATE.start_main_~x~4) (and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= ULTIMATE.start_main_~x~4 86))) (and (<= 56 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 56) (<= ULTIMATE.start_main_~x~4 56) (<= 56 ULTIMATE.start_main_~y~4))) (and (<= 67 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 67))) (and (<= 83 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 83))) (and (and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87)) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) (and (<= 66 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 66) (<= ULTIMATE.start_main_~x~4 66))) (and (and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 80) (<= ULTIMATE.start_main_~y~4 80)) (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 70 ULTIMATE.start_main_~x~4) (and (<= 70 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 70) (<= ULTIMATE.start_main_~y~4 70))) (and (<= 71 ULTIMATE.start_main_~x~4) (and (<= 71 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 71) (<= ULTIMATE.start_main_~y~4 71))) (and (and (<= ULTIMATE.start_main_~x~4 75) (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~y~4)) (<= 75 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 50) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4)) (and (and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 92)) (<= 92 ULTIMATE.start_main_~x~4))) [2018-12-03 16:41:10,589 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 43) no Hoare annotation was computed. [2018-12-03 16:41:10,589 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 43) no Hoare annotation was computed. [2018-12-03 16:41:10,590 INFO L444 ceAbstractionStarter]: At program point L26(lines 26 30) the Hoare annotation is: false [2018-12-03 16:41:10,590 INFO L444 ceAbstractionStarter]: At program point L42(lines 13 42) the Hoare annotation is: (or (and (and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 96)) (<= 96 ULTIMATE.start_main_~x~4)) (and (<= 79 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 79))) (and (and (<= ULTIMATE.start_main_~y~4 97) (<= ULTIMATE.start_main_~x~4 97) (<= 97 ULTIMATE.start_main_~y~4)) (<= 97 ULTIMATE.start_main_~x~4)) (and (and (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95) (<= ULTIMATE.start_main_~x~4 95)) (<= 95 ULTIMATE.start_main_~x~4)) (and (and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 91) (<= ULTIMATE.start_main_~y~4 91)) (<= 91 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 72) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)) (<= 72 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62)) (<= 62 ULTIMATE.start_main_~x~4)) (and (<= 54 ULTIMATE.start_main_~x~4) (and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 54) (<= ULTIMATE.start_main_~y~4 54))) (and (<= 60 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 60) (<= ULTIMATE.start_main_~x~4 60) (<= 60 ULTIMATE.start_main_~y~4))) (and (<= 98 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 98) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4))) (and (and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= ULTIMATE.start_main_~x~4 88)) (<= 88 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 73)) (<= 73 ULTIMATE.start_main_~x~4)) (and (<= 64 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64))) (and (and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76)) (<= 76 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 84) (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~y~4)) (<= 84 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 85)) (<= 85 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61)) (<= 61 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 59) (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4)) (<= 59 ULTIMATE.start_main_~x~4)) (and (<= 69 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 69) (<= ULTIMATE.start_main_~x~4 69) (<= 69 ULTIMATE.start_main_~y~4))) (and (and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= ULTIMATE.start_main_~x~4 55)) (<= 55 ULTIMATE.start_main_~x~4)) (and (and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= ULTIMATE.start_main_~x~4 99)) (<= 99 ULTIMATE.start_main_~x~4)) (and (<= 53 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4))) (and (<= 77 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 77) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4))) (and (<= 89 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 89) (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~y~4))) (and (<= 94 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 94) (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 93)) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= 68 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 68) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 81) (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~y~4)) (<= 81 ULTIMATE.start_main_~x~4)) (and (and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= ULTIMATE.start_main_~x~4 57)) (<= 57 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)) (<= 82 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4)) (<= 58 ULTIMATE.start_main_~x~4)) (and (<= 78 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 78))) (and (and (<= ULTIMATE.start_main_~y~4 65) (<= ULTIMATE.start_main_~x~4 65) (<= 65 ULTIMATE.start_main_~y~4)) (<= 65 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 90)) (<= 90 ULTIMATE.start_main_~x~4)) (and (<= 63 ULTIMATE.start_main_~x~4) (and (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63) (<= ULTIMATE.start_main_~x~4 63))) (and (<= 51 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 51))) (and (<= 52 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52))) (and (and (<= 74 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 74) (<= ULTIMATE.start_main_~y~4 74)) (<= 74 ULTIMATE.start_main_~x~4)) (and (<= 86 ULTIMATE.start_main_~x~4) (and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= ULTIMATE.start_main_~x~4 86))) (and (<= 56 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 56) (<= ULTIMATE.start_main_~x~4 56) (<= 56 ULTIMATE.start_main_~y~4))) (and (<= 67 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 67))) (and (<= 83 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 83))) (and (and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87)) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) (and (<= 66 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 66) (<= ULTIMATE.start_main_~x~4 66))) (and (and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 80) (<= ULTIMATE.start_main_~y~4 80)) (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 70 ULTIMATE.start_main_~x~4) (and (<= 70 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 70) (<= ULTIMATE.start_main_~y~4 70))) (and (<= 71 ULTIMATE.start_main_~x~4) (and (<= 71 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 71) (<= ULTIMATE.start_main_~y~4 71))) (and (and (<= ULTIMATE.start_main_~x~4 75) (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~y~4)) (<= 75 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 100) (< 99 ULTIMATE.start_main_~y~4)) (<= 100 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 50) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4)) (and (and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 92)) (<= 92 ULTIMATE.start_main_~x~4))) [2018-12-03 16:41:10,591 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 31) no Hoare annotation was computed. [2018-12-03 16:41:10,615 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:41:10 BoogieIcfgContainer [2018-12-03 16:41:10,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:41:10,616 INFO L168 Benchmark]: Toolchain (without parser) took 154063.03 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -480.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 16:41:10,617 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:41:10,617 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:41:10,617 INFO L168 Benchmark]: Boogie Preprocessor took 22.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:41:10,618 INFO L168 Benchmark]: RCFGBuilder took 271.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 16:41:10,618 INFO L168 Benchmark]: TraceAbstraction took 153728.52 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -501.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 16:41:10,620 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 271.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 153728.52 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -501.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 31]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((main_~y~4 <= 96 && 96 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4) || (79 <= main_~x~4 && (main_~y~4 <= 79 && 79 <= main_~y~4) && main_~x~4 <= 79)) || (((main_~y~4 <= 97 && main_~x~4 <= 97) && 97 <= main_~y~4) && 97 <= main_~x~4)) || (((95 <= main_~y~4 && main_~y~4 <= 95) && main_~x~4 <= 95) && 95 <= main_~x~4)) || (((91 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 91) && 91 <= main_~x~4)) || (((main_~x~4 <= 72 && 72 <= main_~y~4) && main_~y~4 <= 72) && 72 <= main_~x~4)) || (((main_~x~4 <= 62 && 62 <= main_~y~4) && main_~y~4 <= 62) && 62 <= main_~x~4)) || (54 <= main_~x~4 && (54 <= main_~y~4 && main_~x~4 <= 54) && main_~y~4 <= 54)) || (60 <= main_~x~4 && (main_~y~4 <= 60 && main_~x~4 <= 60) && 60 <= main_~y~4)) || (98 <= main_~x~4 && (main_~x~4 <= 98 && main_~y~4 <= 98) && 98 <= main_~y~4)) || (((88 <= main_~y~4 && main_~y~4 <= 88) && main_~x~4 <= 88) && 88 <= main_~x~4)) || (((main_~x~4 <= 73 && 73 <= main_~y~4) && main_~y~4 <= 73) && 73 <= main_~x~4)) || (64 <= main_~x~4 && (main_~x~4 <= 64 && 64 <= main_~y~4) && main_~y~4 <= 64)) || (((main_~x~4 <= 76 && 76 <= main_~y~4) && main_~y~4 <= 76) && 76 <= main_~x~4)) || (((main_~y~4 <= 84 && main_~x~4 <= 84) && 84 <= main_~y~4) && 84 <= main_~x~4)) || (((main_~y~4 <= 85 && 85 <= main_~y~4) && main_~x~4 <= 85) && 85 <= main_~x~4)) || (((main_~x~4 <= 61 && 61 <= main_~y~4) && main_~y~4 <= 61) && 61 <= main_~x~4)) || (((main_~x~4 <= 59 && main_~y~4 <= 59) && 59 <= main_~y~4) && 59 <= main_~x~4)) || (69 <= main_~x~4 && (main_~y~4 <= 69 && main_~x~4 <= 69) && 69 <= main_~y~4)) || (((55 <= main_~y~4 && main_~y~4 <= 55) && main_~x~4 <= 55) && 55 <= main_~x~4)) || (((99 <= main_~y~4 && main_~y~4 <= 99) && main_~x~4 <= 99) && 99 <= main_~x~4)) || (53 <= main_~x~4 && (main_~x~4 <= 53 && main_~y~4 <= 53) && 53 <= main_~y~4)) || (77 <= main_~x~4 && (main_~x~4 <= 77 && main_~y~4 <= 77) && 77 <= main_~y~4)) || (89 <= main_~x~4 && (main_~y~4 <= 89 && main_~x~4 <= 89) && 89 <= main_~y~4)) || (94 <= main_~x~4 && (main_~y~4 <= 94 && main_~x~4 <= 94) && 94 <= main_~y~4)) || (((main_~y~4 <= 93 && 93 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (68 <= main_~x~4 && (main_~x~4 <= 68 && main_~y~4 <= 68) && 68 <= main_~y~4)) || (((main_~y~4 <= 81 && main_~x~4 <= 81) && 81 <= main_~y~4) && 81 <= main_~x~4)) || (((57 <= main_~y~4 && main_~y~4 <= 57) && main_~x~4 <= 57) && 57 <= main_~x~4)) || (((main_~x~4 <= 82 && 82 <= main_~y~4) && main_~y~4 <= 82) && 82 <= main_~x~4)) || (((main_~y~4 <= 58 && main_~x~4 <= 58) && 58 <= main_~y~4) && 58 <= main_~x~4)) || (78 <= main_~x~4 && (main_~x~4 <= 78 && 78 <= main_~y~4) && main_~y~4 <= 78)) || (((main_~y~4 <= 65 && main_~x~4 <= 65) && 65 <= main_~y~4) && 65 <= main_~x~4)) || (((main_~x~4 <= 90 && 90 <= main_~y~4) && main_~y~4 <= 90) && 90 <= main_~x~4)) || (63 <= main_~x~4 && (63 <= main_~y~4 && main_~y~4 <= 63) && main_~x~4 <= 63)) || (51 <= main_~x~4 && (main_~y~4 <= 51 && 51 <= main_~y~4) && main_~x~4 <= 51)) || (52 <= main_~x~4 && (main_~x~4 <= 52 && 52 <= main_~y~4) && main_~y~4 <= 52)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (56 <= main_~x~4 && (main_~y~4 <= 56 && main_~x~4 <= 56) && 56 <= main_~y~4)) || (67 <= main_~x~4 && (main_~y~4 <= 67 && 67 <= main_~y~4) && main_~x~4 <= 67)) || (83 <= main_~x~4 && (main_~y~4 <= 83 && 83 <= main_~y~4) && main_~x~4 <= 83)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (66 <= main_~x~4 && (66 <= main_~y~4 && main_~y~4 <= 66) && main_~x~4 <= 66)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (71 <= main_~x~4 && (71 <= main_~y~4 && main_~x~4 <= 71) && main_~y~4 <= 71)) || (((main_~x~4 <= 75 && main_~y~4 <= 75) && 75 <= main_~y~4) && 75 <= main_~x~4)) || ((main_~y~4 <= 100 && 99 < main_~y~4) && 100 <= main_~x~4)) || ((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~x~4 <= 92 && 92 <= main_~y~4) && main_~y~4 <= 92) && 92 <= main_~x~4) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((main_~y~4 <= 96 && 96 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4) || (79 <= main_~x~4 && (main_~y~4 <= 79 && 79 <= main_~y~4) && main_~x~4 <= 79)) || (((main_~y~4 <= 97 && main_~x~4 <= 97) && 97 <= main_~y~4) && 97 <= main_~x~4)) || (((95 <= main_~y~4 && main_~y~4 <= 95) && main_~x~4 <= 95) && 95 <= main_~x~4)) || (((91 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 91) && 91 <= main_~x~4)) || (((main_~x~4 <= 72 && 72 <= main_~y~4) && main_~y~4 <= 72) && 72 <= main_~x~4)) || (((main_~x~4 <= 62 && 62 <= main_~y~4) && main_~y~4 <= 62) && 62 <= main_~x~4)) || (54 <= main_~x~4 && (54 <= main_~y~4 && main_~x~4 <= 54) && main_~y~4 <= 54)) || (60 <= main_~x~4 && (main_~y~4 <= 60 && main_~x~4 <= 60) && 60 <= main_~y~4)) || (98 <= main_~x~4 && (main_~x~4 <= 98 && main_~y~4 <= 98) && 98 <= main_~y~4)) || (((88 <= main_~y~4 && main_~y~4 <= 88) && main_~x~4 <= 88) && 88 <= main_~x~4)) || (((main_~x~4 <= 73 && 73 <= main_~y~4) && main_~y~4 <= 73) && 73 <= main_~x~4)) || (64 <= main_~x~4 && (main_~x~4 <= 64 && 64 <= main_~y~4) && main_~y~4 <= 64)) || (((main_~x~4 <= 76 && 76 <= main_~y~4) && main_~y~4 <= 76) && 76 <= main_~x~4)) || (((main_~y~4 <= 84 && main_~x~4 <= 84) && 84 <= main_~y~4) && 84 <= main_~x~4)) || (((main_~y~4 <= 85 && 85 <= main_~y~4) && main_~x~4 <= 85) && 85 <= main_~x~4)) || (((main_~x~4 <= 61 && 61 <= main_~y~4) && main_~y~4 <= 61) && 61 <= main_~x~4)) || (((main_~x~4 <= 59 && main_~y~4 <= 59) && 59 <= main_~y~4) && 59 <= main_~x~4)) || (69 <= main_~x~4 && (main_~y~4 <= 69 && main_~x~4 <= 69) && 69 <= main_~y~4)) || (((55 <= main_~y~4 && main_~y~4 <= 55) && main_~x~4 <= 55) && 55 <= main_~x~4)) || (((99 <= main_~y~4 && main_~y~4 <= 99) && main_~x~4 <= 99) && 99 <= main_~x~4)) || (53 <= main_~x~4 && (main_~x~4 <= 53 && main_~y~4 <= 53) && 53 <= main_~y~4)) || (77 <= main_~x~4 && (main_~x~4 <= 77 && main_~y~4 <= 77) && 77 <= main_~y~4)) || (89 <= main_~x~4 && (main_~y~4 <= 89 && main_~x~4 <= 89) && 89 <= main_~y~4)) || (94 <= main_~x~4 && (main_~y~4 <= 94 && main_~x~4 <= 94) && 94 <= main_~y~4)) || (((main_~y~4 <= 93 && 93 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (68 <= main_~x~4 && (main_~x~4 <= 68 && main_~y~4 <= 68) && 68 <= main_~y~4)) || (((main_~y~4 <= 81 && main_~x~4 <= 81) && 81 <= main_~y~4) && 81 <= main_~x~4)) || (((57 <= main_~y~4 && main_~y~4 <= 57) && main_~x~4 <= 57) && 57 <= main_~x~4)) || (((main_~x~4 <= 82 && 82 <= main_~y~4) && main_~y~4 <= 82) && 82 <= main_~x~4)) || (((main_~y~4 <= 58 && main_~x~4 <= 58) && 58 <= main_~y~4) && 58 <= main_~x~4)) || (78 <= main_~x~4 && (main_~x~4 <= 78 && 78 <= main_~y~4) && main_~y~4 <= 78)) || (((main_~y~4 <= 65 && main_~x~4 <= 65) && 65 <= main_~y~4) && 65 <= main_~x~4)) || (((main_~x~4 <= 90 && 90 <= main_~y~4) && main_~y~4 <= 90) && 90 <= main_~x~4)) || (63 <= main_~x~4 && (63 <= main_~y~4 && main_~y~4 <= 63) && main_~x~4 <= 63)) || (51 <= main_~x~4 && (main_~y~4 <= 51 && 51 <= main_~y~4) && main_~x~4 <= 51)) || (52 <= main_~x~4 && (main_~x~4 <= 52 && 52 <= main_~y~4) && main_~y~4 <= 52)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (56 <= main_~x~4 && (main_~y~4 <= 56 && main_~x~4 <= 56) && 56 <= main_~y~4)) || (67 <= main_~x~4 && (main_~y~4 <= 67 && 67 <= main_~y~4) && main_~x~4 <= 67)) || (83 <= main_~x~4 && (main_~y~4 <= 83 && 83 <= main_~y~4) && main_~x~4 <= 83)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (66 <= main_~x~4 && (66 <= main_~y~4 && main_~y~4 <= 66) && main_~x~4 <= 66)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (71 <= main_~x~4 && (71 <= main_~y~4 && main_~x~4 <= 71) && main_~y~4 <= 71)) || (((main_~x~4 <= 75 && main_~y~4 <= 75) && 75 <= main_~y~4) && 75 <= main_~x~4)) || ((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~x~4 <= 92 && 92 <= main_~y~4) && main_~y~4 <= 92) && 92 <= main_~x~4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 153.6s OverallTime, 65 OverallIterations, 101 TraceHistogramMax, 19.1s AutomataDifference, 0.0s DeadEndRemovalTime, 9.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 332 SDtfs, 1473 SDslu, 6250 SDs, 0 SdLazy, 9650 SolverSat, 2389 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13456 GetRequests, 9202 SyntacticMatches, 1132 SemanticMatches, 3122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125668 ImplicationChecksByTransitivity, 114.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 65 MinimizatonAttempts, 2677 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 204 NumberOfFragments, 1406 HoareAnnotationTreeSize, 3 FomulaSimplifications, 26790 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 396 FormulaSimplificationTreeSizeReductionInter, 8.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 117.9s InterpolantComputationTime, 11890 NumberOfCodeBlocks, 11298 NumberOfCodeBlocksAsserted, 821 NumberOfCheckSat, 17540 ConstructedInterpolants, 0 QuantifiedInterpolants, 5655568 SizeOfPredicates, 53 NumberOfNonLiveVariables, 12902 ConjunctsInSsa, 2050 ConjunctsInUnsatCore, 191 InterpolantComputations, 4 PerfectInterpolantSequences, 262906/532273 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...