java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:10:18,440 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:10:18,442 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:10:18,455 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:10:18,455 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:10:18,456 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:10:18,457 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:10:18,459 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:10:18,461 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:10:18,462 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:10:18,463 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:10:18,463 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:10:18,464 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:10:18,465 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:10:18,466 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:10:18,467 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:10:18,468 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:10:18,470 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:10:18,472 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:10:18,474 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:10:18,475 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:10:18,476 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:10:18,479 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:10:18,479 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:10:18,479 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:10:18,480 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:10:18,481 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:10:18,482 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:10:18,483 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:10:18,484 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:10:18,484 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:10:18,485 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:10:18,485 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:10:18,485 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:10:18,486 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:10:18,487 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:10:18,488 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-25 15:10:18,500 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:10:18,500 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:10:18,501 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:10:18,501 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:10:18,502 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:10:18,502 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:10:18,502 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:10:18,502 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:10:18,502 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-25 15:10:18,503 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:10:18,503 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-25 15:10:18,503 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-25 15:10:18,503 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:10:18,503 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:10:18,504 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:10:18,504 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:10:18,505 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:10:18,505 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:10:18,505 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:10:18,505 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:10:18,505 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:10:18,506 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:10:18,506 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:10:18,506 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:10:18,506 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:10:18,506 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:10:18,507 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:10:18,507 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:10:18,507 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:10:18,507 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:10:18,507 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:10:18,508 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:10:18,508 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:10:18,508 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:10:18,508 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:10:18,508 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:10:18,508 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:10:18,509 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:10:18,509 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:10:18,509 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:10:18,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:10:18,551 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:10:18,554 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:10:18,556 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:10:18,556 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:10:18,557 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl [2019-02-25 15:10:18,557 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl' [2019-02-25 15:10:18,593 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:10:18,595 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:10:18,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:10:18,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:10:18,596 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:10:18,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,623 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,630 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:10:18,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:10:18,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:10:18,632 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:10:18,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:10:18,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:10:18,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:10:18,652 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:10:18,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:10:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:10:18,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:10:19,005 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:10:19,006 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-02-25 15:10:19,007 INFO L202 PluginConnector]: Adding new model array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:10:19 BoogieIcfgContainer [2019-02-25 15:10:19,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:10:19,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:10:19,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:10:19,012 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:10:19,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/2) ... [2019-02-25 15:10:19,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725cbfde and model type array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:10:19, skipping insertion in model container [2019-02-25 15:10:19,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:10:19" (2/2) ... [2019-02-25 15:10:19,016 INFO L112 eAbstractionObserver]: Analyzing ICFG array4.i_4.bpl [2019-02-25 15:10:19,026 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:10:19,034 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-25 15:10:19,050 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-25 15:10:19,083 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:10:19,083 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:10:19,083 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:10:19,084 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:10:19,084 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:10:19,084 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:10:19,084 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:10:19,084 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:10:19,100 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-25 15:10:19,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:10:19,106 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:19,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:10:19,110 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:19,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:19,116 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-02-25 15:10:19,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:19,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:19,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:19,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:19,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:19,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:19,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:10:19,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:10:19,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:10:19,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:10:19,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:10:19,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:10:19,289 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-25 15:10:19,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:19,380 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-02-25 15:10:19,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:10:19,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-25 15:10:19,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:19,394 INFO L225 Difference]: With dead ends: 12 [2019-02-25 15:10:19,395 INFO L226 Difference]: Without dead ends: 7 [2019-02-25 15:10:19,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:10:19,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-25 15:10:19,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-25 15:10:19,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-25 15:10:19,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-02-25 15:10:19,428 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-02-25 15:10:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:19,428 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-02-25 15:10:19,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:10:19,429 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-25 15:10:19,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:10:19,429 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:19,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:10:19,429 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:19,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:19,430 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-02-25 15:10:19,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:19,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:19,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:19,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:19,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:19,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:10:19,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:19,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:19,556 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:10:19,564 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-02-25 15:10:19,641 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:10:19,641 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:10:19,844 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:10:19,846 INFO L272 AbstractInterpreter]: Visited 6 different actions 18 times. Merged at 4 different actions 9 times. Never widened. Performed 166 root evaluator evaluations with a maximum evaluation depth of 5. Performed 166 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:10:19,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:19,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:10:19,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:19,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:19,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:19,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:19,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-25 15:10:19,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:10:19,944 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:20,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:10:20,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:20,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-25 15:10:20,104 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:20,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:10:20,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:10:20,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:10:20,105 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-02-25 15:10:20,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:20,152 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-02-25 15:10:20,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:10:20,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-25 15:10:20,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:20,153 INFO L225 Difference]: With dead ends: 13 [2019-02-25 15:10:20,153 INFO L226 Difference]: Without dead ends: 9 [2019-02-25 15:10:20,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:10:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-25 15:10:20,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-25 15:10:20,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-25 15:10:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-02-25 15:10:20,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-02-25 15:10:20,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:20,158 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-02-25 15:10:20,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:10:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-02-25 15:10:20,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:10:20,159 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:20,159 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-02-25 15:10:20,159 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:20,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:20,160 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-02-25 15:10:20,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:20,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:20,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:20,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:20,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:20,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:10:20,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:20,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:20,237 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:20,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:20,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:20,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:20,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:20,248 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:20,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:10:20,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:20,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-25 15:10:20,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:20,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:10:20,292 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:20,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:10:20,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:20,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-02-25 15:10:20,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:20,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:10:20,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:10:20,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:10:20,521 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-02-25 15:10:20,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:20,657 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-02-25 15:10:20,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:10:20,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-25 15:10:20,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:20,660 INFO L225 Difference]: With dead ends: 16 [2019-02-25 15:10:20,660 INFO L226 Difference]: Without dead ends: 11 [2019-02-25 15:10:20,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:10:20,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-25 15:10:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-25 15:10:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-25 15:10:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-02-25 15:10:20,665 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-02-25 15:10:20,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:20,666 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-02-25 15:10:20,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-25 15:10:20,666 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-02-25 15:10:20,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-25 15:10:20,666 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:20,666 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-02-25 15:10:20,667 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:20,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:20,667 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-02-25 15:10:20,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:20,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:20,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:20,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:20,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-25 15:10:20,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:20,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:20,779 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:20,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:20,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:20,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:20,790 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:20,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:20,835 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:20,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:20,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-25 15:10:20,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-25 15:10:20,842 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:21,050 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-25 15:10:21,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:21,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-25 15:10:21,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:21,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:10:21,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:10:21,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:10:21,081 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-02-25 15:10:21,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:21,129 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-02-25 15:10:21,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:10:21,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-02-25 15:10:21,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:21,130 INFO L225 Difference]: With dead ends: 19 [2019-02-25 15:10:21,131 INFO L226 Difference]: Without dead ends: 13 [2019-02-25 15:10:21,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:10:21,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-25 15:10:21,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-25 15:10:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-25 15:10:21,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-02-25 15:10:21,135 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-02-25 15:10:21,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:21,135 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-02-25 15:10:21,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:10:21,135 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-02-25 15:10:21,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-25 15:10:21,136 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:21,136 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-02-25 15:10:21,136 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:21,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:21,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-02-25 15:10:21,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:21,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:21,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:21,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:21,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-25 15:10:21,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:21,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:21,242 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:21,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:21,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:21,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:21,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:21,251 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:21,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-25 15:10:21,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:21,294 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-25 15:10:21,294 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:21,429 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-25 15:10:21,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:21,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-02-25 15:10:21,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:21,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:10:21,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:10:21,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:10:21,452 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-02-25 15:10:21,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:21,491 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-02-25 15:10:21,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:10:21,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-02-25 15:10:21,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:21,494 INFO L225 Difference]: With dead ends: 22 [2019-02-25 15:10:21,494 INFO L226 Difference]: Without dead ends: 15 [2019-02-25 15:10:21,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:10:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-25 15:10:21,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-25 15:10:21,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-25 15:10:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-02-25 15:10:21,498 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-02-25 15:10:21,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:21,498 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-02-25 15:10:21,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:10:21,499 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-02-25 15:10:21,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-25 15:10:21,499 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:21,499 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-02-25 15:10:21,500 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:21,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:21,500 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-02-25 15:10:21,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:21,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:21,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:21,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:21,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:21,888 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-25 15:10:21,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:21,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:21,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:21,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:21,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:21,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:21,898 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:21,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:21,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-25 15:10:21,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:21,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-25 15:10:21,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:21,929 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-25 15:10:21,929 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:22,067 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-25 15:10:22,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:22,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-02-25 15:10:22,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:22,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:10:22,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:10:22,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:10:22,090 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-02-25 15:10:22,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:22,160 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-02-25 15:10:22,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:10:22,160 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-02-25 15:10:22,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:22,161 INFO L225 Difference]: With dead ends: 25 [2019-02-25 15:10:22,161 INFO L226 Difference]: Without dead ends: 17 [2019-02-25 15:10:22,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:10:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-25 15:10:22,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-25 15:10:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-25 15:10:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-02-25 15:10:22,166 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-02-25 15:10:22,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:22,166 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-02-25 15:10:22,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:10:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-02-25 15:10:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-25 15:10:22,167 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:22,168 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-02-25 15:10:22,168 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:22,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:22,168 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-02-25 15:10:22,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:22,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:22,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:22,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:22,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-25 15:10:22,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:22,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:22,304 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:22,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:22,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:22,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:22,314 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:22,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:22,337 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:22,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:22,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:10:22,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-25 15:10:22,343 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-25 15:10:22,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:22,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-02-25 15:10:22,548 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:22,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:10:22,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:10:22,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:10:22,549 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-02-25 15:10:22,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:22,613 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-02-25 15:10:22,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:10:22,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-02-25 15:10:22,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:22,614 INFO L225 Difference]: With dead ends: 28 [2019-02-25 15:10:22,614 INFO L226 Difference]: Without dead ends: 19 [2019-02-25 15:10:22,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:10:22,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-25 15:10:22,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-25 15:10:22,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-25 15:10:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-02-25 15:10:22,619 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-02-25 15:10:22,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:22,619 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-02-25 15:10:22,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:10:22,619 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-02-25 15:10:22,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-25 15:10:22,620 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:22,620 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-02-25 15:10:22,620 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:22,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:22,620 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-02-25 15:10:22,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:22,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:22,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:22,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:22,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:22,950 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-25 15:10:22,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:22,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:22,951 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:22,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:22,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:22,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:22,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:22,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:22,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:10:22,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:22,985 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-25 15:10:22,985 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:23,159 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-25 15:10:23,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:23,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-02-25 15:10:23,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:23,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:10:23,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:10:23,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:10:23,186 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-02-25 15:10:23,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:23,263 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-02-25 15:10:23,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:10:23,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-02-25 15:10:23,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:23,266 INFO L225 Difference]: With dead ends: 31 [2019-02-25 15:10:23,266 INFO L226 Difference]: Without dead ends: 21 [2019-02-25 15:10:23,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:10:23,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-25 15:10:23,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-25 15:10:23,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-25 15:10:23,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-02-25 15:10:23,271 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-02-25 15:10:23,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:23,271 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-02-25 15:10:23,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:10:23,271 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-02-25 15:10:23,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-25 15:10:23,272 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:23,272 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-02-25 15:10:23,272 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:23,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:23,272 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-02-25 15:10:23,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:23,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:23,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:23,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:23,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:23,445 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-25 15:10:23,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:23,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:23,446 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:23,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:23,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:23,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:23,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:23,455 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:23,473 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-25 15:10:23,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:23,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:10:23,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-25 15:10:23,486 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:23,653 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-25 15:10:23,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:23,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-02-25 15:10:23,677 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:23,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:10:23,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:10:23,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:10:23,678 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-02-25 15:10:23,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:23,857 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-02-25 15:10:23,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:10:23,857 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-02-25 15:10:23,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:23,858 INFO L225 Difference]: With dead ends: 34 [2019-02-25 15:10:23,858 INFO L226 Difference]: Without dead ends: 23 [2019-02-25 15:10:23,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:10:23,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-25 15:10:23,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-25 15:10:23,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-25 15:10:23,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-02-25 15:10:23,865 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-02-25 15:10:23,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:23,866 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-02-25 15:10:23,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:10:23,866 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-02-25 15:10:23,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-25 15:10:23,867 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:23,867 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-02-25 15:10:23,867 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:23,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:23,868 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-02-25 15:10:23,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:23,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:23,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:23,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:23,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-25 15:10:24,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:24,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:24,099 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:24,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:24,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:24,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:24,108 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:24,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:24,126 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:24,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:24,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:10:24,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-25 15:10:24,136 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-25 15:10:24,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:24,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-02-25 15:10:24,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:24,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:10:24,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:10:24,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-25 15:10:24,415 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-02-25 15:10:24,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:24,489 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-02-25 15:10:24,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:10:24,489 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-02-25 15:10:24,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:24,490 INFO L225 Difference]: With dead ends: 37 [2019-02-25 15:10:24,490 INFO L226 Difference]: Without dead ends: 25 [2019-02-25 15:10:24,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-25 15:10:24,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-25 15:10:24,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-25 15:10:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-25 15:10:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-02-25 15:10:24,495 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-02-25 15:10:24,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:24,495 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-02-25 15:10:24,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:10:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-02-25 15:10:24,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-25 15:10:24,496 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:24,496 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-02-25 15:10:24,497 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:24,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:24,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-02-25 15:10:24,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:24,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:24,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:24,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:24,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-25 15:10:24,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:24,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:24,641 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:24,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:24,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:24,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:24,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:24,659 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:24,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:10:24,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:24,683 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-25 15:10:24,683 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:25,289 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-25 15:10:25,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:25,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-02-25 15:10:25,308 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:25,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 15:10:25,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 15:10:25,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-25 15:10:25,309 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-02-25 15:10:25,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:25,391 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-02-25 15:10:25,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-25 15:10:25,392 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-02-25 15:10:25,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:25,392 INFO L225 Difference]: With dead ends: 40 [2019-02-25 15:10:25,392 INFO L226 Difference]: Without dead ends: 27 [2019-02-25 15:10:25,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-25 15:10:25,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-25 15:10:25,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-25 15:10:25,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-25 15:10:25,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-02-25 15:10:25,398 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-02-25 15:10:25,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:25,398 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-02-25 15:10:25,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 15:10:25,398 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-02-25 15:10:25,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-25 15:10:25,399 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:25,399 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-02-25 15:10:25,399 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:25,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:25,399 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-02-25 15:10:25,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:25,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:25,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:25,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:25,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:25,715 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-25 15:10:25,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:25,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:25,715 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:25,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:25,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:25,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:25,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:25,725 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:25,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-25 15:10:25,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:25,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-25 15:10:25,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:25,897 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:25,898 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:25,973 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:25,974 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-02-25 15:10:26,302 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 49 [2019-02-25 15:10:26,308 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-25 15:10:26,406 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:26,406 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:3 [2019-02-25 15:10:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-25 15:10:26,410 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:27,124 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-25 15:10:27,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:27,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 36 [2019-02-25 15:10:27,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:27,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-25 15:10:27,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-25 15:10:27,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=711, Unknown=0, NotChecked=0, Total=1260 [2019-02-25 15:10:27,154 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 24 states. [2019-02-25 15:10:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:29,862 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-02-25 15:10:29,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-25 15:10:29,863 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2019-02-25 15:10:29,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:29,863 INFO L225 Difference]: With dead ends: 43 [2019-02-25 15:10:29,863 INFO L226 Difference]: Without dead ends: 29 [2019-02-25 15:10:29,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=766, Invalid=1040, Unknown=0, NotChecked=0, Total=1806 [2019-02-25 15:10:29,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-25 15:10:29,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-25 15:10:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-25 15:10:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-02-25 15:10:29,870 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-02-25 15:10:29,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:29,870 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-02-25 15:10:29,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-25 15:10:29,870 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-02-25 15:10:29,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-25 15:10:29,871 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:29,871 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-02-25 15:10:29,872 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:29,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:29,872 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-02-25 15:10:29,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:29,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:29,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:29,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:29,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:30,058 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-25 15:10:30,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:30,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:30,059 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:30,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:30,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:30,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:30,069 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:30,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:30,105 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:30,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:30,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:10:30,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:30,114 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-25 15:10:30,115 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:30,457 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-25 15:10:30,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:30,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-02-25 15:10:30,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:30,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-25 15:10:30,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-25 15:10:30,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-25 15:10:30,479 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-02-25 15:10:30,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:30,594 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-02-25 15:10:30,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-25 15:10:30,594 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-02-25 15:10:30,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:30,594 INFO L225 Difference]: With dead ends: 46 [2019-02-25 15:10:30,595 INFO L226 Difference]: Without dead ends: 31 [2019-02-25 15:10:30,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-25 15:10:30,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-25 15:10:30,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-25 15:10:30,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-25 15:10:30,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-02-25 15:10:30,600 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-02-25 15:10:30,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:30,601 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-02-25 15:10:30,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-25 15:10:30,601 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-02-25 15:10:30,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-25 15:10:30,601 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:30,602 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-02-25 15:10:30,602 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:30,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:30,602 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-02-25 15:10:30,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:30,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:30,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:30,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:30,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:30,832 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-25 15:10:30,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:30,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:30,834 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:30,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:30,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:30,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:30,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:30,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:30,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:10:30,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-25 15:10:30,877 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-25 15:10:31,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:31,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-02-25 15:10:31,370 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:31,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-25 15:10:31,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-25 15:10:31,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-25 15:10:31,371 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-02-25 15:10:31,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:31,428 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-02-25 15:10:31,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-25 15:10:31,429 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-02-25 15:10:31,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:31,430 INFO L225 Difference]: With dead ends: 49 [2019-02-25 15:10:31,430 INFO L226 Difference]: Without dead ends: 33 [2019-02-25 15:10:31,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-25 15:10:31,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-25 15:10:31,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-25 15:10:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-25 15:10:31,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-02-25 15:10:31,437 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-02-25 15:10:31,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:31,437 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-02-25 15:10:31,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-25 15:10:31,437 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-02-25 15:10:31,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-25 15:10:31,438 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:31,438 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-02-25 15:10:31,439 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:31,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:31,439 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-02-25 15:10:31,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:31,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:31,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:31,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:31,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:31,661 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-25 15:10:31,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:31,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:31,661 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:31,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:31,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:31,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:31,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:31,672 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:31,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-25 15:10:31,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:31,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:10:31,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-25 15:10:31,725 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:32,056 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-25 15:10:32,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:32,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 32 [2019-02-25 15:10:32,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:32,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-25 15:10:32,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-25 15:10:32,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:10:32,077 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-02-25 15:10:32,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:32,184 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-02-25 15:10:32,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-25 15:10:32,185 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-02-25 15:10:32,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:32,185 INFO L225 Difference]: With dead ends: 52 [2019-02-25 15:10:32,185 INFO L226 Difference]: Without dead ends: 35 [2019-02-25 15:10:32,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:10:32,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-25 15:10:32,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-25 15:10:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-25 15:10:32,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-02-25 15:10:32,192 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-02-25 15:10:32,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:32,193 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-02-25 15:10:32,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-25 15:10:32,193 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-02-25 15:10:32,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-25 15:10:32,194 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:32,194 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-02-25 15:10:32,194 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:32,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:32,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-02-25 15:10:32,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:32,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:32,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:32,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:32,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-25 15:10:32,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:32,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:32,467 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:32,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:32,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:32,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:32,480 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:32,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:32,505 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:32,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:32,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:10:32,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-25 15:10:32,514 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:33,296 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-25 15:10:33,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:33,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-02-25 15:10:33,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:33,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-25 15:10:33,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-25 15:10:33,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-25 15:10:33,317 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-02-25 15:10:33,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:33,449 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-02-25 15:10:33,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-25 15:10:33,450 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-02-25 15:10:33,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:33,450 INFO L225 Difference]: With dead ends: 55 [2019-02-25 15:10:33,450 INFO L226 Difference]: Without dead ends: 37 [2019-02-25 15:10:33,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-25 15:10:33,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-25 15:10:33,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-25 15:10:33,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-25 15:10:33,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-02-25 15:10:33,456 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-02-25 15:10:33,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:33,456 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-02-25 15:10:33,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-25 15:10:33,457 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-02-25 15:10:33,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-25 15:10:33,457 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:33,458 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-02-25 15:10:33,458 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:33,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:33,458 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-02-25 15:10:33,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:33,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:33,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:33,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:33,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:33,674 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-25 15:10:33,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:33,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:33,675 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:33,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:33,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:33,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:33,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:33,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:33,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:10:33,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-25 15:10:33,728 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-25 15:10:34,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:34,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-02-25 15:10:34,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:34,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-25 15:10:34,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-25 15:10:34,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-25 15:10:34,494 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-02-25 15:10:34,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:34,561 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-02-25 15:10:34,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-25 15:10:34,561 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-02-25 15:10:34,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:34,562 INFO L225 Difference]: With dead ends: 58 [2019-02-25 15:10:34,562 INFO L226 Difference]: Without dead ends: 39 [2019-02-25 15:10:34,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-25 15:10:34,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-25 15:10:34,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-25 15:10:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-25 15:10:34,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-02-25 15:10:34,569 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-02-25 15:10:34,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:34,570 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-02-25 15:10:34,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-25 15:10:34,570 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-02-25 15:10:34,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-25 15:10:34,571 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:34,571 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-02-25 15:10:34,571 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:34,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:34,571 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-02-25 15:10:34,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:34,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:34,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:34,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:34,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-25 15:10:35,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:35,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:35,232 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:35,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:35,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:35,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:35,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:35,241 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:35,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-25 15:10:35,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:35,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:10:35,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-25 15:10:35,323 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:36,090 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-25 15:10:36,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:36,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-02-25 15:10:36,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:36,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-25 15:10:36,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-25 15:10:36,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:10:36,113 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-02-25 15:10:36,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:36,359 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-02-25 15:10:36,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-25 15:10:36,359 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-02-25 15:10:36,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:36,360 INFO L225 Difference]: With dead ends: 61 [2019-02-25 15:10:36,360 INFO L226 Difference]: Without dead ends: 41 [2019-02-25 15:10:36,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:10:36,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-25 15:10:36,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-25 15:10:36,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-25 15:10:36,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-02-25 15:10:36,366 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-02-25 15:10:36,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:36,367 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-02-25 15:10:36,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-25 15:10:36,367 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-02-25 15:10:36,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-25 15:10:36,368 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:36,368 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-02-25 15:10:36,368 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:36,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:36,368 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-02-25 15:10:36,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:36,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:36,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:36,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:36,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:36,691 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-25 15:10:36,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:36,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:36,691 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:36,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:36,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:36,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:36,703 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:36,704 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:36,727 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:36,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:36,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:10:36,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-25 15:10:36,738 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:37,238 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-25 15:10:37,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:37,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-02-25 15:10:37,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:37,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-25 15:10:37,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-25 15:10:37,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-25 15:10:37,259 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-02-25 15:10:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:37,409 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-02-25 15:10:37,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-25 15:10:37,409 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-02-25 15:10:37,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:37,410 INFO L225 Difference]: With dead ends: 64 [2019-02-25 15:10:37,410 INFO L226 Difference]: Without dead ends: 43 [2019-02-25 15:10:37,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-25 15:10:37,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-25 15:10:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-25 15:10:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-25 15:10:37,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-02-25 15:10:37,415 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-02-25 15:10:37,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:37,415 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-02-25 15:10:37,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-25 15:10:37,415 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-02-25 15:10:37,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-25 15:10:37,416 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:37,416 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-02-25 15:10:37,416 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:37,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:37,417 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-02-25 15:10:37,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:37,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:37,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:37,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:37,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:37,687 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-25 15:10:37,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:37,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:37,687 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:37,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:37,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:37,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:37,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:37,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:37,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:10:37,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:37,729 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-25 15:10:37,730 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:38,298 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-25 15:10:38,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:38,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-02-25 15:10:38,319 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:38,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-25 15:10:38,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-25 15:10:38,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-25 15:10:38,320 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-02-25 15:10:38,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:38,394 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-02-25 15:10:38,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-25 15:10:38,395 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-02-25 15:10:38,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:38,396 INFO L225 Difference]: With dead ends: 67 [2019-02-25 15:10:38,396 INFO L226 Difference]: Without dead ends: 45 [2019-02-25 15:10:38,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-25 15:10:38,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-25 15:10:38,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-25 15:10:38,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-25 15:10:38,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-02-25 15:10:38,402 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-02-25 15:10:38,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:38,402 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-02-25 15:10:38,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-25 15:10:38,403 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-02-25 15:10:38,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-25 15:10:38,403 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:38,404 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-02-25 15:10:38,404 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:38,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:38,404 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-02-25 15:10:38,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:38,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:38,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:38,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:38,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:38,638 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-25 15:10:38,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:38,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:38,638 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:38,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:38,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:38,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:38,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:38,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:38,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-25 15:10:38,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:38,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-25 15:10:38,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:38,747 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-25 15:10:38,748 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:39,457 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-25 15:10:39,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:39,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-02-25 15:10:39,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:39,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-25 15:10:39,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-25 15:10:39,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:10:39,479 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-02-25 15:10:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:39,585 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-02-25 15:10:39,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-25 15:10:39,585 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-02-25 15:10:39,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:39,586 INFO L225 Difference]: With dead ends: 70 [2019-02-25 15:10:39,586 INFO L226 Difference]: Without dead ends: 47 [2019-02-25 15:10:39,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:10:39,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-25 15:10:39,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-25 15:10:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-25 15:10:39,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-02-25 15:10:39,592 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-02-25 15:10:39,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:39,593 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-02-25 15:10:39,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-25 15:10:39,593 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-02-25 15:10:39,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-25 15:10:39,594 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:39,594 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-02-25 15:10:39,594 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:39,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:39,594 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-02-25 15:10:39,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:39,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:39,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:39,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:39,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-25 15:10:39,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:39,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:39,874 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:39,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:39,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:39,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:39,884 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:39,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:39,917 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:39,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:39,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 23 conjunts are in the unsatisfiable core [2019-02-25 15:10:39,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:39,927 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-25 15:10:39,927 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:40,510 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-25 15:10:40,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:40,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-02-25 15:10:40,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:40,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-25 15:10:40,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-25 15:10:40,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-25 15:10:40,532 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-02-25 15:10:40,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:40,658 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-02-25 15:10:40,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-25 15:10:40,660 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-02-25 15:10:40,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:40,661 INFO L225 Difference]: With dead ends: 73 [2019-02-25 15:10:40,661 INFO L226 Difference]: Without dead ends: 49 [2019-02-25 15:10:40,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-25 15:10:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-25 15:10:40,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-25 15:10:40,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-25 15:10:40,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-02-25 15:10:40,666 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-02-25 15:10:40,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:40,666 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-02-25 15:10:40,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-25 15:10:40,666 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-02-25 15:10:40,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-25 15:10:40,667 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:40,667 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-02-25 15:10:40,668 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:40,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:40,668 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-02-25 15:10:40,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:40,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:40,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:40,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:40,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:41,145 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-25 15:10:41,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:41,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:41,146 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:41,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:41,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:41,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:41,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:41,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:41,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 24 conjunts are in the unsatisfiable core [2019-02-25 15:10:41,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:41,195 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-25 15:10:41,196 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:41,751 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-25 15:10:41,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:41,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-02-25 15:10:41,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:41,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-25 15:10:41,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-25 15:10:41,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-25 15:10:41,771 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-02-25 15:10:41,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:41,851 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-02-25 15:10:41,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-25 15:10:41,852 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-02-25 15:10:41,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:41,853 INFO L225 Difference]: With dead ends: 76 [2019-02-25 15:10:41,853 INFO L226 Difference]: Without dead ends: 51 [2019-02-25 15:10:41,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-25 15:10:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-25 15:10:41,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-25 15:10:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-25 15:10:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-02-25 15:10:41,858 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-02-25 15:10:41,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:41,858 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-02-25 15:10:41,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-25 15:10:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-02-25 15:10:41,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-25 15:10:41,859 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:41,859 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-02-25 15:10:41,859 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:41,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:41,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-02-25 15:10:41,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:41,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:41,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:41,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:41,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-25 15:10:42,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:42,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:42,326 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:42,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:42,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:42,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:42,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:42,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:42,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-25 15:10:42,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:42,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-25 15:10:42,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-25 15:10:42,517 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-25 15:10:43,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:43,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 50 [2019-02-25 15:10:43,703 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:43,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-25 15:10:43,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-25 15:10:43,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:10:43,704 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-02-25 15:10:43,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:43,776 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-02-25 15:10:43,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-25 15:10:43,776 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-02-25 15:10:43,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:43,777 INFO L225 Difference]: With dead ends: 79 [2019-02-25 15:10:43,777 INFO L226 Difference]: Without dead ends: 53 [2019-02-25 15:10:43,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:10:43,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-25 15:10:43,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-25 15:10:43,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-25 15:10:43,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-02-25 15:10:43,782 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-02-25 15:10:43,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:43,782 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-02-25 15:10:43,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-25 15:10:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-02-25 15:10:43,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-25 15:10:43,783 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:43,783 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-02-25 15:10:43,783 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:43,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:43,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-02-25 15:10:43,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:43,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:43,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:43,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:43,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:44,864 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-25 15:10:44,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:44,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:44,864 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:44,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:44,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:44,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:44,873 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:44,873 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:44,904 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:44,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:44,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-25 15:10:44,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:44,912 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-25 15:10:44,912 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-25 15:10:45,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:45,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-02-25 15:10:45,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:45,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-25 15:10:45,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-25 15:10:45,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-25 15:10:45,818 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-02-25 15:10:45,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:45,997 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-02-25 15:10:45,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-25 15:10:45,998 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-02-25 15:10:45,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:45,998 INFO L225 Difference]: With dead ends: 82 [2019-02-25 15:10:45,998 INFO L226 Difference]: Without dead ends: 55 [2019-02-25 15:10:45,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-25 15:10:45,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-25 15:10:46,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-25 15:10:46,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-25 15:10:46,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-02-25 15:10:46,003 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-02-25 15:10:46,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:46,003 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-02-25 15:10:46,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-25 15:10:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-02-25 15:10:46,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-25 15:10:46,004 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:46,004 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-02-25 15:10:46,005 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:46,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:46,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-02-25 15:10:46,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:46,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:46,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:46,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:46,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:46,592 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-25 15:10:46,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:46,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:46,593 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:46,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:46,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:46,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:46,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:46,603 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:46,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 27 conjunts are in the unsatisfiable core [2019-02-25 15:10:46,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:46,648 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-25 15:10:46,648 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:47,389 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-25 15:10:47,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:47,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-02-25 15:10:47,408 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:47,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-25 15:10:47,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-25 15:10:47,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-25 15:10:47,410 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-02-25 15:10:47,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:47,505 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-02-25 15:10:47,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-25 15:10:47,505 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-02-25 15:10:47,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:47,506 INFO L225 Difference]: With dead ends: 85 [2019-02-25 15:10:47,506 INFO L226 Difference]: Without dead ends: 57 [2019-02-25 15:10:47,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-25 15:10:47,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-25 15:10:47,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-25 15:10:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-25 15:10:47,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-02-25 15:10:47,511 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-02-25 15:10:47,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:47,512 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-02-25 15:10:47,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-25 15:10:47,512 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-02-25 15:10:47,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-25 15:10:47,512 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:47,512 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-02-25 15:10:47,512 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:47,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:47,513 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-02-25 15:10:47,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:47,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:47,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:47,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:47,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:48,322 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-25 15:10:48,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:48,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:48,323 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:48,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:48,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:48,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:48,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:48,332 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:48,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-25 15:10:48,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:48,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 33 conjunts are in the unsatisfiable core [2019-02-25 15:10:48,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:48,505 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-25 15:10:48,505 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-25 15:10:49,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:49,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 29] total 56 [2019-02-25 15:10:49,465 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:49,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-25 15:10:49,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-25 15:10:49,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-25 15:10:49,467 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-02-25 15:10:49,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:49,552 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-02-25 15:10:49,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-25 15:10:49,553 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-02-25 15:10:49,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:49,554 INFO L225 Difference]: With dead ends: 88 [2019-02-25 15:10:49,554 INFO L226 Difference]: Without dead ends: 59 [2019-02-25 15:10:49,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-25 15:10:49,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-25 15:10:49,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-25 15:10:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-25 15:10:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-02-25 15:10:49,558 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-02-25 15:10:49,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:49,559 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-02-25 15:10:49,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-25 15:10:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-02-25 15:10:49,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-25 15:10:49,559 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:49,559 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-02-25 15:10:49,559 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:49,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:49,562 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-02-25 15:10:49,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:49,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:49,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:49,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:49,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:50,325 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-25 15:10:50,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:50,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:50,325 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:50,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:50,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:50,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:50,335 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:50,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:50,372 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:50,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:50,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 29 conjunts are in the unsatisfiable core [2019-02-25 15:10:50,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:50,384 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-25 15:10:50,384 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:51,606 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-25 15:10:51,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:51,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-02-25 15:10:51,626 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:51,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-25 15:10:51,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-25 15:10:51,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-25 15:10:51,627 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-02-25 15:10:51,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:51,756 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-02-25 15:10:51,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-25 15:10:51,756 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-02-25 15:10:51,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:51,757 INFO L225 Difference]: With dead ends: 91 [2019-02-25 15:10:51,757 INFO L226 Difference]: Without dead ends: 61 [2019-02-25 15:10:51,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-25 15:10:51,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-25 15:10:51,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-25 15:10:51,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-25 15:10:51,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-02-25 15:10:51,762 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-02-25 15:10:51,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:51,763 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-02-25 15:10:51,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-25 15:10:51,763 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-02-25 15:10:51,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-25 15:10:51,764 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:51,764 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-02-25 15:10:51,764 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:51,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:51,764 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-02-25 15:10:51,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:51,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:51,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:51,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:51,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:52,251 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-25 15:10:52,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:52,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:52,252 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:52,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:52,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:52,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:52,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:52,262 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:52,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-25 15:10:52,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:52,321 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-25 15:10:52,322 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-25 15:10:53,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:53,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-02-25 15:10:53,401 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:53,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-25 15:10:53,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-25 15:10:53,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-25 15:10:53,402 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-02-25 15:10:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:53,539 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-02-25 15:10:53,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-25 15:10:53,540 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-02-25 15:10:53,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:53,540 INFO L225 Difference]: With dead ends: 94 [2019-02-25 15:10:53,540 INFO L226 Difference]: Without dead ends: 63 [2019-02-25 15:10:53,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-25 15:10:53,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-25 15:10:53,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-25 15:10:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-25 15:10:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-02-25 15:10:53,545 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-02-25 15:10:53,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:53,546 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-02-25 15:10:53,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-25 15:10:53,546 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-02-25 15:10:53,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-25 15:10:53,546 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:53,546 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-02-25 15:10:53,547 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:53,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:53,547 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-02-25 15:10:53,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:53,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:53,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:53,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:53,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:54,038 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-25 15:10:54,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:54,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:54,038 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:54,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:54,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:54,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:54,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:54,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:54,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-25 15:10:54,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:54,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 36 conjunts are in the unsatisfiable core [2019-02-25 15:10:54,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:54,254 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-25 15:10:54,255 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-25 15:10:55,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:55,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 32] total 62 [2019-02-25 15:10:55,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:55,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-25 15:10:55,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-25 15:10:55,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:10:55,241 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-02-25 15:10:55,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:55,315 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-02-25 15:10:55,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-25 15:10:55,316 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-02-25 15:10:55,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:55,316 INFO L225 Difference]: With dead ends: 97 [2019-02-25 15:10:55,317 INFO L226 Difference]: Without dead ends: 65 [2019-02-25 15:10:55,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:10:55,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-25 15:10:55,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-25 15:10:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-25 15:10:55,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-02-25 15:10:55,320 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-02-25 15:10:55,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:55,320 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-02-25 15:10:55,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-25 15:10:55,321 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-02-25 15:10:55,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-25 15:10:55,321 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:55,321 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-02-25 15:10:55,321 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:55,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:55,322 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-02-25 15:10:55,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:55,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:55,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:55,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:55,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:55,762 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-25 15:10:55,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:55,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:55,762 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:55,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:55,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:55,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:55,771 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:55,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:55,808 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:55,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:55,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 32 conjunts are in the unsatisfiable core [2019-02-25 15:10:55,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-25 15:10:55,817 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-25 15:10:57,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:57,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-02-25 15:10:57,244 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:57,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-25 15:10:57,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-25 15:10:57,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-25 15:10:57,246 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-02-25 15:10:57,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:57,367 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-02-25 15:10:57,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-25 15:10:57,368 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-02-25 15:10:57,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:57,369 INFO L225 Difference]: With dead ends: 100 [2019-02-25 15:10:57,369 INFO L226 Difference]: Without dead ends: 67 [2019-02-25 15:10:57,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-25 15:10:57,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-25 15:10:57,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-25 15:10:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-25 15:10:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-02-25 15:10:57,373 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-02-25 15:10:57,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:57,374 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-02-25 15:10:57,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-25 15:10:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-02-25 15:10:57,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-25 15:10:57,375 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:57,375 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-02-25 15:10:57,375 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:57,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:57,375 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-02-25 15:10:57,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:57,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:57,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:57,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:57,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:58,030 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-25 15:10:58,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:58,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:58,030 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:58,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:58,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:58,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:58,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:58,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:58,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 33 conjunts are in the unsatisfiable core [2019-02-25 15:10:58,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-25 15:10:58,101 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-25 15:10:59,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:59,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-02-25 15:10:59,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:59,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-25 15:10:59,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-25 15:10:59,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-25 15:10:59,298 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-02-25 15:10:59,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:59,428 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-02-25 15:10:59,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-25 15:10:59,429 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-02-25 15:10:59,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:59,430 INFO L225 Difference]: With dead ends: 103 [2019-02-25 15:10:59,430 INFO L226 Difference]: Without dead ends: 69 [2019-02-25 15:10:59,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-25 15:10:59,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-25 15:10:59,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-25 15:10:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-25 15:10:59,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-02-25 15:10:59,435 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-02-25 15:10:59,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:59,435 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-02-25 15:10:59,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-25 15:10:59,436 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-02-25 15:10:59,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-25 15:10:59,436 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:59,436 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-02-25 15:10:59,436 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:59,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:59,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-02-25 15:10:59,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:59,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:59,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:59,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:59,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:00,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-25 15:11:00,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:00,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:00,257 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:00,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:00,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:00,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:00,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:00,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:00,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-25 15:11:00,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:00,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-25 15:11:00,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:00,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-25 15:11:00,522 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:01,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-25 15:11:01,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:01,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-02-25 15:11:01,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:01,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-25 15:11:01,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-25 15:11:01,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-25 15:11:01,925 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-02-25 15:11:02,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:02,078 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-02-25 15:11:02,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-25 15:11:02,078 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-02-25 15:11:02,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:02,079 INFO L225 Difference]: With dead ends: 106 [2019-02-25 15:11:02,079 INFO L226 Difference]: Without dead ends: 71 [2019-02-25 15:11:02,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-25 15:11:02,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-25 15:11:02,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-25 15:11:02,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-25 15:11:02,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-02-25 15:11:02,084 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-02-25 15:11:02,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:02,085 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-02-25 15:11:02,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-25 15:11:02,085 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-02-25 15:11:02,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-25 15:11:02,085 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:02,085 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-02-25 15:11:02,086 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:02,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:02,086 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-02-25 15:11:02,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:02,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:02,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:02,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:02,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-25 15:11:02,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:02,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:02,687 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:02,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:02,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:02,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:02,697 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:02,697 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:02,741 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:02,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:02,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 35 conjunts are in the unsatisfiable core [2019-02-25 15:11:02,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:02,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-25 15:11:02,752 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-25 15:11:04,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:04,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-02-25 15:11:04,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:04,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-25 15:11:04,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-25 15:11:04,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-25 15:11:04,024 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-02-25 15:11:04,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:04,185 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-02-25 15:11:04,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-25 15:11:04,185 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-02-25 15:11:04,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:04,186 INFO L225 Difference]: With dead ends: 109 [2019-02-25 15:11:04,186 INFO L226 Difference]: Without dead ends: 73 [2019-02-25 15:11:04,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-25 15:11:04,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-25 15:11:04,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-25 15:11:04,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-25 15:11:04,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-02-25 15:11:04,190 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-02-25 15:11:04,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:04,190 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-02-25 15:11:04,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-25 15:11:04,191 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-02-25 15:11:04,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-25 15:11:04,191 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:04,191 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-02-25 15:11:04,192 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:04,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:04,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-02-25 15:11:04,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:04,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:04,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:04,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:04,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:04,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-25 15:11:04,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:04,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:04,746 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:04,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:04,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:04,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:04,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:04,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:04,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 36 conjunts are in the unsatisfiable core [2019-02-25 15:11:04,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:04,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-25 15:11:04,814 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-25 15:11:06,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:06,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-02-25 15:11:06,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:06,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-25 15:11:06,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-25 15:11:06,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-25 15:11:06,163 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-02-25 15:11:06,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:06,403 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-02-25 15:11:06,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-25 15:11:06,404 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-02-25 15:11:06,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:06,404 INFO L225 Difference]: With dead ends: 112 [2019-02-25 15:11:06,404 INFO L226 Difference]: Without dead ends: 75 [2019-02-25 15:11:06,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-25 15:11:06,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-25 15:11:06,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-25 15:11:06,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-25 15:11:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-02-25 15:11:06,408 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-02-25 15:11:06,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:06,408 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-02-25 15:11:06,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-25 15:11:06,409 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-02-25 15:11:06,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-25 15:11:06,409 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:06,409 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-02-25 15:11:06,409 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:06,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:06,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-02-25 15:11:06,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:06,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:06,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:06,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:06,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:07,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-25 15:11:07,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:07,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:07,109 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:07,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:07,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:07,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:07,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:07,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:07,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-25 15:11:07,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:07,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 37 conjunts are in the unsatisfiable core [2019-02-25 15:11:07,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-25 15:11:07,573 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-25 15:11:08,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:08,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-02-25 15:11:08,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:08,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-25 15:11:08,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-25 15:11:08,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:11:08,999 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-02-25 15:11:09,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:09,136 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-02-25 15:11:09,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-25 15:11:09,137 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-02-25 15:11:09,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:09,138 INFO L225 Difference]: With dead ends: 115 [2019-02-25 15:11:09,138 INFO L226 Difference]: Without dead ends: 77 [2019-02-25 15:11:09,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:11:09,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-25 15:11:09,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-25 15:11:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-25 15:11:09,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-02-25 15:11:09,141 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-02-25 15:11:09,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:09,142 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-02-25 15:11:09,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-25 15:11:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-02-25 15:11:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-25 15:11:09,142 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:09,142 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-02-25 15:11:09,143 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:09,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:09,143 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-02-25 15:11:09,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:09,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:09,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:09,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:09,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-25 15:11:09,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:09,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:09,794 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:09,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:09,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:09,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:09,805 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:09,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:09,854 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:09,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:09,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 38 conjunts are in the unsatisfiable core [2019-02-25 15:11:09,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:09,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-25 15:11:09,868 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:11,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-25 15:11:11,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:11,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-02-25 15:11:11,870 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:11,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-25 15:11:11,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-25 15:11:11,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-25 15:11:11,871 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-02-25 15:11:12,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:12,019 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-02-25 15:11:12,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-25 15:11:12,019 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-02-25 15:11:12,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:12,020 INFO L225 Difference]: With dead ends: 118 [2019-02-25 15:11:12,020 INFO L226 Difference]: Without dead ends: 79 [2019-02-25 15:11:12,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-25 15:11:12,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-25 15:11:12,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-25 15:11:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-25 15:11:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-02-25 15:11:12,026 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-02-25 15:11:12,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:12,026 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-02-25 15:11:12,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-25 15:11:12,027 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-02-25 15:11:12,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-25 15:11:12,027 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:12,027 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-02-25 15:11:12,028 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:12,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:12,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-02-25 15:11:12,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:12,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:12,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:12,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:12,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:12,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-25 15:11:12,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:12,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:12,854 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:12,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:12,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:12,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:12,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:12,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:12,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 39 conjunts are in the unsatisfiable core [2019-02-25 15:11:12,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-25 15:11:12,928 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-25 15:11:14,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:14,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-02-25 15:11:14,577 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:14,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-25 15:11:14,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-25 15:11:14,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-25 15:11:14,578 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-02-25 15:11:14,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:14,707 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-02-25 15:11:14,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-25 15:11:14,707 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-02-25 15:11:14,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:14,708 INFO L225 Difference]: With dead ends: 121 [2019-02-25 15:11:14,708 INFO L226 Difference]: Without dead ends: 81 [2019-02-25 15:11:14,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-25 15:11:14,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-25 15:11:14,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-25 15:11:14,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-25 15:11:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-02-25 15:11:14,713 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-02-25 15:11:14,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:14,713 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-02-25 15:11:14,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-25 15:11:14,713 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-02-25 15:11:14,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-25 15:11:14,713 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:14,714 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-02-25 15:11:14,714 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:14,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:14,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-02-25 15:11:14,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:14,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:14,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:14,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:14,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-25 15:11:15,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:15,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:15,484 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:15,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:15,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:15,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:15,492 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:15,492 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:16,002 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-25 15:11:16,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:16,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-25 15:11:16,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:16,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-25 15:11:16,021 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-25 15:11:17,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:17,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-02-25 15:11:17,947 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:17,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-25 15:11:17,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-25 15:11:17,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:11:17,948 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-02-25 15:11:18,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:18,083 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-02-25 15:11:18,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-25 15:11:18,084 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-02-25 15:11:18,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:18,085 INFO L225 Difference]: With dead ends: 124 [2019-02-25 15:11:18,085 INFO L226 Difference]: Without dead ends: 83 [2019-02-25 15:11:18,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:11:18,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-25 15:11:18,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-25 15:11:18,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-25 15:11:18,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-02-25 15:11:18,089 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-02-25 15:11:18,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:18,090 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-02-25 15:11:18,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-25 15:11:18,090 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-02-25 15:11:18,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-25 15:11:18,090 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:18,090 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-02-25 15:11:18,091 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:18,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:18,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-02-25 15:11:18,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:18,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:18,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:18,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:18,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:19,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-25 15:11:19,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:19,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:19,326 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:19,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:19,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:19,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:19,335 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:19,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:19,388 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:19,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:19,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 41 conjunts are in the unsatisfiable core [2019-02-25 15:11:19,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:19,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-25 15:11:19,399 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:21,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-25 15:11:21,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:21,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-02-25 15:11:21,383 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:21,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-25 15:11:21,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-25 15:11:21,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-25 15:11:21,384 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-02-25 15:11:21,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:21,555 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-02-25 15:11:21,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-25 15:11:21,555 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-02-25 15:11:21,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:21,556 INFO L225 Difference]: With dead ends: 127 [2019-02-25 15:11:21,556 INFO L226 Difference]: Without dead ends: 85 [2019-02-25 15:11:21,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-25 15:11:21,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-25 15:11:21,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-25 15:11:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-25 15:11:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-02-25 15:11:21,561 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-02-25 15:11:21,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:21,561 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-02-25 15:11:21,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-25 15:11:21,561 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-02-25 15:11:21,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-25 15:11:21,562 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:21,562 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-02-25 15:11:21,562 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:21,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:21,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-02-25 15:11:21,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:21,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:21,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:21,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:21,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-25 15:11:22,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:22,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:22,491 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:22,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:22,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:22,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:22,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:22,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:22,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 42 conjunts are in the unsatisfiable core [2019-02-25 15:11:22,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-25 15:11:22,576 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-25 15:11:24,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:24,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-02-25 15:11:24,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:24,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-25 15:11:24,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-25 15:11:24,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-25 15:11:24,482 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-02-25 15:11:24,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:24,628 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-02-25 15:11:24,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-25 15:11:24,629 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-02-25 15:11:24,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:24,630 INFO L225 Difference]: With dead ends: 130 [2019-02-25 15:11:24,630 INFO L226 Difference]: Without dead ends: 87 [2019-02-25 15:11:24,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-25 15:11:24,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-25 15:11:24,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-25 15:11:24,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-25 15:11:24,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-02-25 15:11:24,635 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-02-25 15:11:24,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:24,635 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-02-25 15:11:24,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-25 15:11:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-02-25 15:11:24,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-25 15:11:24,636 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:24,636 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-02-25 15:11:24,636 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:24,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:24,637 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-02-25 15:11:24,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:24,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:24,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:24,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:24,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:25,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-25 15:11:25,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:25,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:25,464 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:25,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:25,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:25,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:25,474 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:25,474 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:26,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-25 15:11:26,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:26,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 43 conjunts are in the unsatisfiable core [2019-02-25 15:11:26,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:26,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-25 15:11:26,105 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-25 15:11:28,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:28,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-02-25 15:11:28,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:28,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-25 15:11:28,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-25 15:11:28,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:11:28,346 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-02-25 15:11:28,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:28,492 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-02-25 15:11:28,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-25 15:11:28,492 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-02-25 15:11:28,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:28,493 INFO L225 Difference]: With dead ends: 133 [2019-02-25 15:11:28,493 INFO L226 Difference]: Without dead ends: 89 [2019-02-25 15:11:28,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:11:28,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-25 15:11:28,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-25 15:11:28,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-25 15:11:28,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-02-25 15:11:28,499 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-02-25 15:11:28,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:28,499 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-02-25 15:11:28,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-25 15:11:28,499 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-02-25 15:11:28,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-25 15:11:28,500 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:28,500 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-02-25 15:11:28,500 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:28,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:28,500 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-02-25 15:11:28,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:28,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:28,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:28,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:28,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:29,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-25 15:11:29,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:29,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:29,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:29,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:29,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:29,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:29,399 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:29,399 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:29,455 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:29,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:29,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 44 conjunts are in the unsatisfiable core [2019-02-25 15:11:29,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-25 15:11:29,471 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:31,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-25 15:11:31,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:31,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-02-25 15:11:31,462 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:31,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-25 15:11:31,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-25 15:11:31,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-25 15:11:31,463 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-02-25 15:11:31,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:31,629 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-02-25 15:11:31,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-25 15:11:31,630 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-02-25 15:11:31,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:31,631 INFO L225 Difference]: With dead ends: 136 [2019-02-25 15:11:31,631 INFO L226 Difference]: Without dead ends: 91 [2019-02-25 15:11:31,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-25 15:11:31,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-25 15:11:31,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-25 15:11:31,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-25 15:11:31,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-02-25 15:11:31,636 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-02-25 15:11:31,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:31,637 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-02-25 15:11:31,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-25 15:11:31,637 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-02-25 15:11:31,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-25 15:11:31,637 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:31,637 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-02-25 15:11:31,638 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:31,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:31,638 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-02-25 15:11:31,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:31,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:31,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:31,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:31,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:32,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-25 15:11:32,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:32,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:32,879 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:32,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:32,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:32,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:32,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:32,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:32,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 45 conjunts are in the unsatisfiable core [2019-02-25 15:11:32,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-25 15:11:32,957 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-25 15:11:35,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:35,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-02-25 15:11:35,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:35,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-25 15:11:35,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-25 15:11:35,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-25 15:11:35,065 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-02-25 15:11:35,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:35,666 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-02-25 15:11:35,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-25 15:11:35,666 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-02-25 15:11:35,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:35,667 INFO L225 Difference]: With dead ends: 139 [2019-02-25 15:11:35,667 INFO L226 Difference]: Without dead ends: 93 [2019-02-25 15:11:35,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-25 15:11:35,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-25 15:11:35,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-25 15:11:35,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-25 15:11:35,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-02-25 15:11:35,672 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-02-25 15:11:35,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:35,680 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-02-25 15:11:35,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-25 15:11:35,680 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-02-25 15:11:35,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-25 15:11:35,680 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:35,681 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-02-25 15:11:35,681 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:35,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:35,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-02-25 15:11:35,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:35,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:35,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:35,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:35,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-25 15:11:36,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:36,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:36,576 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:36,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:36,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:36,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:36,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:36,584 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:37,325 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-25 15:11:37,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:37,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 51 conjunts are in the unsatisfiable core [2019-02-25 15:11:37,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:37,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-25 15:11:37,347 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:39,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-25 15:11:39,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:39,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 47, 47] total 92 [2019-02-25 15:11:39,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:39,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-25 15:11:39,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-25 15:11:39,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:11:39,464 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-02-25 15:11:40,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:40,408 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-02-25 15:11:40,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-25 15:11:40,409 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-02-25 15:11:40,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:40,409 INFO L225 Difference]: With dead ends: 142 [2019-02-25 15:11:40,409 INFO L226 Difference]: Without dead ends: 95 [2019-02-25 15:11:40,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:11:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-25 15:11:40,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-25 15:11:40,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-25 15:11:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-02-25 15:11:40,414 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-02-25 15:11:40,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:40,415 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-02-25 15:11:40,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-25 15:11:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-02-25 15:11:40,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-25 15:11:40,415 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:40,415 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-02-25 15:11:40,416 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:40,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:40,416 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-02-25 15:11:40,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:40,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:40,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:40,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:40,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:41,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-25 15:11:41,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:41,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:41,330 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:41,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:41,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:41,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:41,353 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:41,353 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:41,424 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:41,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:41,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 47 conjunts are in the unsatisfiable core [2019-02-25 15:11:41,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-25 15:11:41,444 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:44,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-25 15:11:44,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:44,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-02-25 15:11:44,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:44,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-25 15:11:44,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-25 15:11:44,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-25 15:11:44,859 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-02-25 15:11:45,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:45,012 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-02-25 15:11:45,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-25 15:11:45,013 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-02-25 15:11:45,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:45,014 INFO L225 Difference]: With dead ends: 145 [2019-02-25 15:11:45,014 INFO L226 Difference]: Without dead ends: 97 [2019-02-25 15:11:45,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-25 15:11:45,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-25 15:11:45,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-25 15:11:45,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-25 15:11:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-02-25 15:11:45,018 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-02-25 15:11:45,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:45,018 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-02-25 15:11:45,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-25 15:11:45,018 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-02-25 15:11:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-25 15:11:45,019 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:45,019 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-02-25 15:11:45,019 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:45,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:45,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-02-25 15:11:45,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:45,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:45,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:45,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:45,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-25 15:11:45,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:45,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:45,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:45,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:45,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:45,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:45,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:45,999 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:46,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 48 conjunts are in the unsatisfiable core [2019-02-25 15:11:46,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:46,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-25 15:11:46,077 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:48,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-25 15:11:48,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:48,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-02-25 15:11:48,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:48,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-25 15:11:48,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-25 15:11:48,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-25 15:11:48,697 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-02-25 15:11:48,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:48,985 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-02-25 15:11:48,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-25 15:11:48,986 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-02-25 15:11:48,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:48,986 INFO L225 Difference]: With dead ends: 148 [2019-02-25 15:11:48,986 INFO L226 Difference]: Without dead ends: 99 [2019-02-25 15:11:48,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-25 15:11:48,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-25 15:11:48,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-25 15:11:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-25 15:11:48,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-02-25 15:11:48,990 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-02-25 15:11:48,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:48,990 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-02-25 15:11:48,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-25 15:11:48,990 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-02-25 15:11:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-25 15:11:48,991 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:48,991 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-02-25 15:11:48,991 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:48,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:48,991 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-02-25 15:11:48,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:48,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:48,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:48,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:48,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-25 15:11:50,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:50,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:50,271 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:50,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:50,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:50,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:50,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:50,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:51,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-25 15:11:51,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:51,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 49 conjunts are in the unsatisfiable core [2019-02-25 15:11:51,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:51,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-25 15:11:51,972 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-25 15:11:54,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:54,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-02-25 15:11:54,884 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:54,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-25 15:11:54,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-25 15:11:54,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:11:54,885 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-02-25 15:11:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:55,245 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-02-25 15:11:55,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-25 15:11:55,245 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-02-25 15:11:55,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:55,246 INFO L225 Difference]: With dead ends: 151 [2019-02-25 15:11:55,246 INFO L226 Difference]: Without dead ends: 101 [2019-02-25 15:11:55,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:11:55,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-25 15:11:55,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-02-25 15:11:55,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-25 15:11:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-02-25 15:11:55,250 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-02-25 15:11:55,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:55,251 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-02-25 15:11:55,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-25 15:11:55,251 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-02-25 15:11:55,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-25 15:11:55,252 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:55,252 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-02-25 15:11:55,252 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:55,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:55,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-02-25 15:11:55,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:55,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:55,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:55,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:55,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:57,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-25 15:11:57,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:57,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:57,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:57,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:57,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:57,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:57,686 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:57,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:57,773 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:57,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:57,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 50 conjunts are in the unsatisfiable core [2019-02-25 15:11:57,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:57,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-25 15:11:57,789 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-25 15:12:00,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:00,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-02-25 15:12:00,401 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:00,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-25 15:12:00,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-25 15:12:00,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-25 15:12:00,402 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-02-25 15:12:00,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:00,572 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-02-25 15:12:00,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-25 15:12:00,572 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-02-25 15:12:00,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:00,573 INFO L225 Difference]: With dead ends: 154 [2019-02-25 15:12:00,574 INFO L226 Difference]: Without dead ends: 103 [2019-02-25 15:12:00,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-25 15:12:00,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-25 15:12:00,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-02-25 15:12:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-25 15:12:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-02-25 15:12:00,578 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-02-25 15:12:00,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:00,579 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-02-25 15:12:00,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-25 15:12:00,579 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-02-25 15:12:00,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-25 15:12:00,579 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:00,579 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-02-25 15:12:00,579 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:00,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:00,580 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-02-25 15:12:00,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:00,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:00,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:00,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:00,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:02,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-25 15:12:02,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:02,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:02,264 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:02,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:02,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:02,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:02,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:02,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:12:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:02,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 51 conjunts are in the unsatisfiable core [2019-02-25 15:12:02,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-25 15:12:02,354 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-25 15:12:05,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:05,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-02-25 15:12:05,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:05,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-25 15:12:05,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-25 15:12:05,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-25 15:12:05,283 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-02-25 15:12:05,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:05,500 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-02-25 15:12:05,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-25 15:12:05,501 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-02-25 15:12:05,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:05,501 INFO L225 Difference]: With dead ends: 157 [2019-02-25 15:12:05,501 INFO L226 Difference]: Without dead ends: 105 [2019-02-25 15:12:05,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-25 15:12:05,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-25 15:12:05,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-02-25 15:12:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-25 15:12:05,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-02-25 15:12:05,506 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-02-25 15:12:05,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:05,506 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-02-25 15:12:05,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-25 15:12:05,506 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-02-25 15:12:05,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-25 15:12:05,507 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:05,507 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-02-25 15:12:05,507 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:05,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:05,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-02-25 15:12:05,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:05,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:05,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:05,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:05,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-25 15:12:06,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:06,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:06,893 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:06,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:06,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:06,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:06,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:12:06,902 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:12:07,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-25 15:12:07,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:07,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-25 15:12:07,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-25 15:12:07,980 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-25 15:12:10,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:10,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-02-25 15:12:10,757 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:10,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-25 15:12:10,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-25 15:12:10,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:12:10,758 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-02-25 15:12:11,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:11,087 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-02-25 15:12:11,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-25 15:12:11,088 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-02-25 15:12:11,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:11,089 INFO L225 Difference]: With dead ends: 160 [2019-02-25 15:12:11,089 INFO L226 Difference]: Without dead ends: 107 [2019-02-25 15:12:11,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:12:11,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-25 15:12:11,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-02-25 15:12:11,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-25 15:12:11,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-02-25 15:12:11,096 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-02-25 15:12:11,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:11,097 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-02-25 15:12:11,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-25 15:12:11,097 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-02-25 15:12:11,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-25 15:12:11,097 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:11,098 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-02-25 15:12:11,098 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:11,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:11,098 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-02-25 15:12:11,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:11,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:11,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:11,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:11,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:12,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-25 15:12:12,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:12,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:12,398 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:12,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:12,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:12,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:12,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:12:12,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:12:12,474 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:12:12,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:12,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 53 conjunts are in the unsatisfiable core [2019-02-25 15:12:12,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:12,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-25 15:12:12,490 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-25 15:12:15,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:15,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-02-25 15:12:15,653 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:15,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-25 15:12:15,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-25 15:12:15,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-25 15:12:15,655 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-02-25 15:12:15,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:15,901 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-02-25 15:12:15,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-25 15:12:15,902 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-02-25 15:12:15,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:15,902 INFO L225 Difference]: With dead ends: 163 [2019-02-25 15:12:15,902 INFO L226 Difference]: Without dead ends: 109 [2019-02-25 15:12:15,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-25 15:12:15,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-25 15:12:15,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-02-25 15:12:15,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-25 15:12:15,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-02-25 15:12:15,908 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-02-25 15:12:15,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:15,908 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-02-25 15:12:15,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-25 15:12:15,908 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-02-25 15:12:15,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-25 15:12:15,909 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:15,909 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-02-25 15:12:15,909 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:15,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:15,910 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-02-25 15:12:15,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:15,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:15,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:15,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:15,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-25 15:12:17,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:17,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:17,829 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:17,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:17,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:17,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:17,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:17,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:12:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:17,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 54 conjunts are in the unsatisfiable core [2019-02-25 15:12:17,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:17,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-25 15:12:17,923 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:21,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-25 15:12:21,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:21,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-02-25 15:12:21,091 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:21,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-25 15:12:21,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-25 15:12:21,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-25 15:12:21,092 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-02-25 15:12:21,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:21,344 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-02-25 15:12:21,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-25 15:12:21,345 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-02-25 15:12:21,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:21,345 INFO L225 Difference]: With dead ends: 166 [2019-02-25 15:12:21,345 INFO L226 Difference]: Without dead ends: 111 [2019-02-25 15:12:21,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-25 15:12:21,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-25 15:12:21,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-02-25 15:12:21,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-25 15:12:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-02-25 15:12:21,350 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-02-25 15:12:21,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:21,350 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-02-25 15:12:21,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-25 15:12:21,350 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-02-25 15:12:21,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-25 15:12:21,351 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:21,351 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-02-25 15:12:21,351 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:21,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:21,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-02-25 15:12:21,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:21,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:21,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:21,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:21,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-25 15:12:22,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:22,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:22,561 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:22,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:22,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:22,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:22,573 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:12:22,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:12:24,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-02-25 15:12:24,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:24,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 85 conjunts are in the unsatisfiable core [2019-02-25 15:12:24,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:24,089 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:12:24,090 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:12:24,094 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:12:24,094 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-02-25 15:12:56,740 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-02-25 15:12:56,941 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:56,943 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:934) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:581) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2019-02-25 15:12:56,948 INFO L168 Benchmark]: Toolchain (without parser) took 158353.95 ms. Allocated memory was 138.9 MB in the beginning and 691.5 MB in the end (delta: 552.6 MB). Free memory was 106.5 MB in the beginning and 413.7 MB in the end (delta: -307.2 MB). Peak memory consumption was 245.4 MB. Max. memory is 7.1 GB. [2019-02-25 15:12:56,950 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 138.9 MB. Free memory is still 107.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-25 15:12:56,950 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.85 ms. Allocated memory is still 138.9 MB. Free memory was 106.3 MB in the beginning and 104.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-02-25 15:12:56,951 INFO L168 Benchmark]: Boogie Preprocessor took 20.20 ms. Allocated memory is still 138.9 MB. Free memory was 104.7 MB in the beginning and 103.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-25 15:12:56,952 INFO L168 Benchmark]: RCFGBuilder took 355.69 ms. Allocated memory is still 138.9 MB. Free memory was 103.6 MB in the beginning and 94.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-02-25 15:12:56,952 INFO L168 Benchmark]: TraceAbstraction took 157938.47 ms. Allocated memory was 138.9 MB in the beginning and 691.5 MB in the end (delta: 552.6 MB). Free memory was 94.1 MB in the beginning and 413.7 MB in the end (delta: -319.5 MB). Peak memory consumption was 233.1 MB. Max. memory is 7.1 GB. [2019-02-25 15:12:56,956 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.17 ms. Allocated memory is still 138.9 MB. Free memory is still 107.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.85 ms. Allocated memory is still 138.9 MB. Free memory was 106.3 MB in the beginning and 104.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.20 ms. Allocated memory is still 138.9 MB. Free memory was 104.7 MB in the beginning and 103.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 355.69 ms. Allocated memory is still 138.9 MB. Free memory was 103.6 MB in the beginning and 94.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 157938.47 ms. Allocated memory was 138.9 MB in the beginning and 691.5 MB in the end (delta: 552.6 MB). Free memory was 94.1 MB in the beginning and 413.7 MB in the end (delta: -319.5 MB). Peak memory consumption was 233.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...