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/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-df3cc4e-m [2019-01-11 11:00:50,241 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 11:00:50,249 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 11:00:50,265 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 11:00:50,265 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 11:00:50,266 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 11:00:50,268 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 11:00:50,270 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 11:00:50,271 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 11:00:50,272 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 11:00:50,273 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 11:00:50,274 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 11:00:50,275 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 11:00:50,276 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 11:00:50,280 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 11:00:50,281 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 11:00:50,282 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 11:00:50,286 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 11:00:50,294 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 11:00:50,298 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 11:00:50,299 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 11:00:50,303 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 11:00:50,305 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 11:00:50,306 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 11:00:50,306 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 11:00:50,309 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 11:00:50,310 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 11:00:50,313 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 11:00:50,314 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 11:00:50,315 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 11:00:50,315 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 11:00:50,318 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 11:00:50,318 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 11:00:50,318 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 11:00:50,319 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 11:00:50,320 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 11:00:50,320 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-01-11 11:00:50,345 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 11:00:50,345 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 11:00:50,346 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 11:00:50,346 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 11:00:50,346 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 11:00:50,347 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 11:00:50,350 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 11:00:50,350 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 11:00:50,350 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 11:00:50,351 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 11:00:50,351 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 11:00:50,351 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 11:00:50,351 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 11:00:50,352 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 11:00:50,352 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 11:00:50,354 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 11:00:50,355 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 11:00:50,355 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 11:00:50,355 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 11:00:50,355 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 11:00:50,355 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 11:00:50,356 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 11:00:50,356 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 11:00:50,356 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 11:00:50,356 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 11:00:50,356 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 11:00:50,356 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 11:00:50,358 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 11:00:50,358 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 11:00:50,358 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 11:00:50,359 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 11:00:50,359 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:00:50,359 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 11:00:50,359 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 11:00:50,359 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 11:00:50,360 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 11:00:50,360 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 11:00:50,360 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 11:00:50,360 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 11:00:50,361 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 11:00:50,400 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 11:00:50,412 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 11:00:50,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 11:00:50,417 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 11:00:50,417 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 11:00:50,418 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2019-01-11 11:00:50,418 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2019-01-11 11:00:50,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 11:00:50,454 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 11:00:50,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 11:00:50,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 11:00:50,454 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 11:00:50,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:00:50" (1/1) ... [2019-01-11 11:00:50,482 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:00:50" (1/1) ... [2019-01-11 11:00:50,490 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 11:00:50,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 11:00:50,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 11:00:50,491 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 11:00:50,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:00:50" (1/1) ... [2019-01-11 11:00:50,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:00:50" (1/1) ... [2019-01-11 11:00:50,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:00:50" (1/1) ... [2019-01-11 11:00:50,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:00:50" (1/1) ... [2019-01-11 11:00:50,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:00:50" (1/1) ... [2019-01-11 11:00:50,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:00:50" (1/1) ... [2019-01-11 11:00:50,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:00:50" (1/1) ... [2019-01-11 11:00:50,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 11:00:50,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 11:00:50,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 11:00:50,513 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 11:00:50,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:00:50" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-11 11:00:50,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 11:00:50,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 11:00:50,865 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 11:00:50,865 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-11 11:00:50,866 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:00:50 BoogieIcfgContainer [2019-01-11 11:00:50,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 11:00:50,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 11:00:50,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 11:00:50,871 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 11:00:50,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:00:50" (1/2) ... [2019-01-11 11:00:50,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54a514e4 and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 11:00:50, skipping insertion in model container [2019-01-11 11:00:50,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:00:50" (2/2) ... [2019-01-11 11:00:50,874 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2019-01-11 11:00:50,882 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 11:00:50,888 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 11:00:50,901 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 11:00:50,929 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 11:00:50,930 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 11:00:50,930 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 11:00:50,930 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 11:00:50,930 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 11:00:50,930 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 11:00:50,931 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 11:00:50,931 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 11:00:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-11 11:00:50,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:00:50,952 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:50,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:00:50,955 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:50,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:50,961 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-11 11:00:50,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:51,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:51,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:00:51,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:51,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:51,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:00:51,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:00:51,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 11:00:51,090 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:00:51,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:00:51,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:00:51,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:00:51,109 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-11 11:00:51,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:51,210 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-11 11:00:51,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:00:51,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-11 11:00:51,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:51,228 INFO L225 Difference]: With dead ends: 12 [2019-01-11 11:00:51,228 INFO L226 Difference]: Without dead ends: 7 [2019-01-11 11:00:51,232 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-01-11 11:00:51,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-11 11:00:51,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-11 11:00:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-11 11:00:51,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-11 11:00:51,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-11 11:00:51,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:51,266 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-11 11:00:51,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:00:51,266 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-11 11:00:51,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:00:51,267 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:51,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:00:51,268 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:51,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:51,268 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-01-11 11:00:51,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:51,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:51,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:00:51,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:51,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:51,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:00:51,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:51,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:00:51,423 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:00:51,434 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-01-11 11:00:51,505 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:00:51,505 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:00:51,751 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:00:51,755 INFO L272 AbstractInterpreter]: Visited 6 different actions 18 times. Merged at 4 different actions 9 times. Never widened. Performed 198 root evaluator evaluations with a maximum evaluation depth of 6. Performed 198 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:00:51,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:51,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:00:51,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:51,768 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-01-11 11:00:51,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:00:51,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:00:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:51,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:00:51,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:00:51,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:00:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:00:51,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:00:51,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-11 11:00:51,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:00:51,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:00:51,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:00:51,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-11 11:00:51,980 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-01-11 11:00:52,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:52,055 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-01-11 11:00:52,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:00:52,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-11 11:00:52,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:52,057 INFO L225 Difference]: With dead ends: 13 [2019-01-11 11:00:52,057 INFO L226 Difference]: Without dead ends: 9 [2019-01-11 11:00:52,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-11 11:00:52,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-11 11:00:52,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-11 11:00:52,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-11 11:00:52,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-11 11:00:52,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-01-11 11:00:52,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:52,061 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-11 11:00:52,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:00:52,061 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-11 11:00:52,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:00:52,062 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:52,062 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-11 11:00:52,062 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:52,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:52,063 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-01-11 11:00:52,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:52,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:52,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:00:52,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:52,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:52,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:00:52,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:52,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:00:52,147 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:00:52,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:00:52,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:52,148 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-01-11 11:00:52,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:00:52,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:00:52,205 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 11:00:52,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:00:52,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:00:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:00:52,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:00:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:00:52,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:00:52,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-11 11:00:52,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:00:52,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 11:00:52,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 11:00:52,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:00:52,411 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-01-11 11:00:52,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:52,568 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-01-11 11:00:52,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:00:52,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-11 11:00:52,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:52,570 INFO L225 Difference]: With dead ends: 16 [2019-01-11 11:00:52,570 INFO L226 Difference]: Without dead ends: 11 [2019-01-11 11:00:52,571 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-01-11 11:00:52,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-11 11:00:52,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-11 11:00:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-11 11:00:52,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-11 11:00:52,574 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-01-11 11:00:52,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:52,575 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-11 11:00:52,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 11:00:52,575 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-11 11:00:52,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 11:00:52,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:52,576 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-01-11 11:00:52,576 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:52,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:52,577 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-01-11 11:00:52,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:52,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:52,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:00:52,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:52,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-11 11:00:52,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:52,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:00:52,678 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:00:52,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:00:52,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:52,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 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-01-11 11:00:52,688 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:00:52,688 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:00:52,710 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:00:52,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:00:52,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:00:52,717 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-11 11:00:52,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:00:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-11 11:00:52,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:00:52,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-11 11:00:52,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:00:52,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:00:52,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:00:52,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:00:52,901 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-01-11 11:00:52,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:52,960 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-01-11 11:00:52,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:00:52,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-11 11:00:52,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:52,961 INFO L225 Difference]: With dead ends: 19 [2019-01-11 11:00:52,961 INFO L226 Difference]: Without dead ends: 13 [2019-01-11 11:00:52,962 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-01-11 11:00:52,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-11 11:00:52,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-11 11:00:52,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-11 11:00:52,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-11 11:00:52,966 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-01-11 11:00:52,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:52,966 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-11 11:00:52,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:00:52,966 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-11 11:00:52,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-11 11:00:52,967 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:52,967 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-01-11 11:00:52,967 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:52,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:52,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-01-11 11:00:52,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:52,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:52,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:00:52,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:52,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:53,087 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-11 11:00:53,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:53,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:00:53,088 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:00:53,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:00:53,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:53,089 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-01-11 11:00:53,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:00:53,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:00:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:53,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:00:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-11 11:00:53,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:00:53,209 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-11 11:00:53,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:00:53,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-11 11:00:53,231 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:00:53,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 11:00:53,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 11:00:53,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:00:53,232 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-01-11 11:00:53,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:53,351 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-01-11 11:00:53,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:00:53,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-11 11:00:53,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:53,352 INFO L225 Difference]: With dead ends: 22 [2019-01-11 11:00:53,352 INFO L226 Difference]: Without dead ends: 15 [2019-01-11 11:00:53,353 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-01-11 11:00:53,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-11 11:00:53,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-11 11:00:53,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-11 11:00:53,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-11 11:00:53,357 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-01-11 11:00:53,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:53,358 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-11 11:00:53,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 11:00:53,358 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-11 11:00:53,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-11 11:00:53,359 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:53,359 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-01-11 11:00:53,359 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:53,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:53,360 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-01-11 11:00:53,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:53,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:53,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:00:53,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:53,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:53,667 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-11 11:00:53,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:53,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:00:53,667 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:00:53,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:00:53,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:53,668 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-01-11 11:00:53,676 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:00:53,676 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:00:53,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 11:00:53,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:00:53,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:00:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-11 11:00:53,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:00:53,918 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-11 11:00:53,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:00:53,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-11 11:00:53,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:00:53,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:00:53,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:00:53,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:00:53,938 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-01-11 11:00:53,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:53,984 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-01-11 11:00:53,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:00:53,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-11 11:00:53,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:53,986 INFO L225 Difference]: With dead ends: 25 [2019-01-11 11:00:53,986 INFO L226 Difference]: Without dead ends: 17 [2019-01-11 11:00:53,987 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-01-11 11:00:53,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-11 11:00:53,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-11 11:00:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 11:00:53,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-11 11:00:53,991 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-01-11 11:00:53,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:53,992 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-11 11:00:53,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:00:53,992 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-11 11:00:53,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-11 11:00:53,992 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:53,993 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-01-11 11:00:53,993 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:53,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:53,993 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-01-11 11:00:53,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:53,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:53,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:00:53,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:53,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-11 11:00:54,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:54,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:00:54,123 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:00:54,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:00:54,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:54,123 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-01-11 11:00:54,132 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:00:54,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:00:54,159 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:00:54,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:00:54,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:00:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-11 11:00:54,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:00:54,444 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-11 11:00:54,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:00:54,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-11 11:00:54,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:00:54,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:00:54,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:00:54,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:00:54,465 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-01-11 11:00:54,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:54,539 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-01-11 11:00:54,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:00:54,539 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-01-11 11:00:54,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:54,539 INFO L225 Difference]: With dead ends: 28 [2019-01-11 11:00:54,539 INFO L226 Difference]: Without dead ends: 19 [2019-01-11 11:00:54,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:00:54,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-11 11:00:54,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-11 11:00:54,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-11 11:00:54,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-01-11 11:00:54,544 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-01-11 11:00:54,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:54,544 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-01-11 11:00:54,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:00:54,544 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-11 11:00:54,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-11 11:00:54,545 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:54,545 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-01-11 11:00:54,545 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:54,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:54,546 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-01-11 11:00:54,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:54,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:54,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:00:54,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:54,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:54,702 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-11 11:00:54,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:54,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:00:54,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:00:54,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:00:54,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:54,703 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-01-11 11:00:54,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:00:54,712 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:00:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:54,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:00:54,748 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-11 11:00:54,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:00:54,903 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-11 11:00:54,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:00:54,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-11 11:00:54,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:00:54,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:00:54,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:00:54,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:00:54,924 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-01-11 11:00:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:54,963 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-11 11:00:54,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:00:54,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-01-11 11:00:54,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:54,966 INFO L225 Difference]: With dead ends: 31 [2019-01-11 11:00:54,967 INFO L226 Difference]: Without dead ends: 21 [2019-01-11 11:00:54,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:00:54,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-11 11:00:54,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-11 11:00:54,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-11 11:00:54,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-11 11:00:54,971 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-01-11 11:00:54,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:54,971 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-11 11:00:54,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:00:54,971 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-11 11:00:54,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-11 11:00:54,972 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:54,972 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-01-11 11:00:54,972 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:54,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:54,973 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-01-11 11:00:54,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:54,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:54,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:00:54,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:54,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:55,088 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-11 11:00:55,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:55,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:00:55,090 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:00:55,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:00:55,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:55,090 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-01-11 11:00:55,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:00:55,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:00:55,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-11 11:00:55,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:00:55,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:00:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-11 11:00:55,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:00:55,414 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-11 11:00:55,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:00:55,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-11 11:00:55,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:00:55,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:00:55,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:00:55,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:00:55,436 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-01-11 11:00:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:55,598 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-01-11 11:00:55,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:00:55,599 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-11 11:00:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:55,599 INFO L225 Difference]: With dead ends: 34 [2019-01-11 11:00:55,600 INFO L226 Difference]: Without dead ends: 23 [2019-01-11 11:00:55,600 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-01-11 11:00:55,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-11 11:00:55,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-11 11:00:55,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-11 11:00:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-11 11:00:55,604 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-01-11 11:00:55,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:55,604 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-11 11:00:55,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:00:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-11 11:00:55,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-11 11:00:55,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:55,605 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-01-11 11:00:55,606 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:55,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:55,606 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-01-11 11:00:55,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:55,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:55,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:00:55,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:55,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-11 11:00:55,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:55,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:00:55,831 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:00:55,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:00:55,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:55,831 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-01-11 11:00:55,840 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:00:55,840 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:00:55,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:00:55,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:00:55,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:00:55,894 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-11 11:00:55,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:00:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-11 11:00:56,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:00:56,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-11 11:00:56,501 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:00:56,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:00:56,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:00:56,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-11 11:00:56,503 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-01-11 11:00:56,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:56,623 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-01-11 11:00:56,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 11:00:56,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-01-11 11:00:56,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:56,625 INFO L225 Difference]: With dead ends: 37 [2019-01-11 11:00:56,625 INFO L226 Difference]: Without dead ends: 25 [2019-01-11 11:00:56,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-11 11:00:56,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-11 11:00:56,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-11 11:00:56,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-11 11:00:56,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-11 11:00:56,631 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-01-11 11:00:56,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:56,632 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-11 11:00:56,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:00:56,632 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-11 11:00:56,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-11 11:00:56,633 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:56,638 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-01-11 11:00:56,639 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:56,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:56,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-01-11 11:00:56,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:56,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:56,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:00:56,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:56,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:57,168 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-11 11:00:57,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:57,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:00:57,169 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:00:57,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:00:57,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:57,169 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-01-11 11:00:57,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:00:57,181 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:00:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:57,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:00:57,219 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-11 11:00:57,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:00:57,721 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-11 11:00:57,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:00:57,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-11 11:00:57,739 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:00:57,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:00:57,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:00:57,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-11 11:00:57,741 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-01-11 11:00:57,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:57,794 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-01-11 11:00:57,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-11 11:00:57,796 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-01-11 11:00:57,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:57,797 INFO L225 Difference]: With dead ends: 40 [2019-01-11 11:00:57,797 INFO L226 Difference]: Without dead ends: 27 [2019-01-11 11:00:57,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-11 11:00:57,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-11 11:00:57,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-11 11:00:57,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-11 11:00:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-11 11:00:57,802 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-01-11 11:00:57,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:57,803 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-11 11:00:57,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:00:57,803 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-11 11:00:57,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-11 11:00:57,803 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:57,804 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-01-11 11:00:57,804 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:57,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:57,804 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-01-11 11:00:57,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:57,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:57,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:00:57,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:57,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-11 11:00:57,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:57,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:00:57,973 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:00:57,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:00:57,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:57,974 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-01-11 11:00:57,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:00:57,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:00:58,011 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-11 11:00:58,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:00:58,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:00:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-11 11:00:58,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:00:58,323 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-11 11:00:58,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:00:58,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-01-11 11:00:58,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:00:58,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:00:58,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:00:58,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-11 11:00:58,346 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-01-11 11:00:58,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:58,416 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-01-11 11:00:58,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-11 11:00:58,416 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-01-11 11:00:58,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:58,417 INFO L225 Difference]: With dead ends: 43 [2019-01-11 11:00:58,417 INFO L226 Difference]: Without dead ends: 29 [2019-01-11 11:00:58,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-11 11:00:58,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-11 11:00:58,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-11 11:00:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-11 11:00:58,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-11 11:00:58,423 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-01-11 11:00:58,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:58,424 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-11 11:00:58,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:00:58,424 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-11 11:00:58,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-11 11:00:58,425 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:58,425 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-01-11 11:00:58,425 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:58,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:58,425 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-01-11 11:00:58,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:58,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:58,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:00:58,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:58,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-11 11:00:58,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:58,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:00:58,593 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:00:58,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:00:58,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:58,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 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-01-11 11:00:58,601 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:00:58,602 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:00:58,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:00:58,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:00:58,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:00:58,648 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-11 11:00:58,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:00:58,902 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-11 11:00:58,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:00:58,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-11 11:00:58,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:00:58,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-11 11:00:58,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-11 11:00:58,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-11 11:00:58,925 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-01-11 11:00:59,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:59,070 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-01-11 11:00:59,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-11 11:00:59,070 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-01-11 11:00:59,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:59,071 INFO L225 Difference]: With dead ends: 46 [2019-01-11 11:00:59,071 INFO L226 Difference]: Without dead ends: 31 [2019-01-11 11:00:59,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-11 11:00:59,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-11 11:00:59,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-11 11:00:59,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-11 11:00:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-01-11 11:00:59,076 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-01-11 11:00:59,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:59,076 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-01-11 11:00:59,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-11 11:00:59,076 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-11 11:00:59,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-11 11:00:59,077 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:59,077 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-01-11 11:00:59,077 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:59,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:59,078 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-01-11 11:00:59,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:59,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:59,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:00:59,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:59,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-11 11:00:59,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:59,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:00:59,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:00:59,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:00:59,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:59,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 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-01-11 11:00:59,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:00:59,273 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:00:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:59,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:00:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-11 11:00:59,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:00:59,680 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-11 11:00:59,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:00:59,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-11 11:00:59,700 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:00:59,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-11 11:00:59,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-11 11:00:59,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-11 11:00:59,701 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-01-11 11:00:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:59,886 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-01-11 11:00:59,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-11 11:00:59,886 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-11 11:00:59,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:59,887 INFO L225 Difference]: With dead ends: 49 [2019-01-11 11:00:59,887 INFO L226 Difference]: Without dead ends: 33 [2019-01-11 11:00:59,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-11 11:00:59,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-11 11:00:59,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-11 11:00:59,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-11 11:00:59,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-11 11:00:59,893 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-01-11 11:00:59,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:59,893 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-11 11:00:59,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-11 11:00:59,893 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-11 11:00:59,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-11 11:00:59,894 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:59,894 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-01-11 11:00:59,895 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:59,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:59,895 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-01-11 11:00:59,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:59,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:59,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:00:59,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:59,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:00,052 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-11 11:01:00,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:00,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:00,053 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:00,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:00,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:00,053 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-01-11 11:01:00,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:00,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:00,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-11 11:01:00,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:00,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:00,117 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-11 11:01:00,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-11 11:01:00,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:00,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-01-11 11:01:00,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:00,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-11 11:01:00,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-11 11:01:00,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-11 11:01:00,596 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-01-11 11:01:00,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:00,650 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-01-11 11:01:00,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-11 11:01:00,652 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-01-11 11:01:00,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:00,653 INFO L225 Difference]: With dead ends: 52 [2019-01-11 11:01:00,653 INFO L226 Difference]: Without dead ends: 35 [2019-01-11 11:01:00,654 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-01-11 11:01:00,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-11 11:01:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-11 11:01:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-11 11:01:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-11 11:01:00,658 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-01-11 11:01:00,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:00,658 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-11 11:01:00,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-11 11:01:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-11 11:01:00,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-11 11:01:00,659 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:00,659 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-01-11 11:01:00,660 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:00,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:00,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-01-11 11:01:00,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:00,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:00,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:00,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:00,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:00,901 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-11 11:01:00,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:00,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:00,902 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:00,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:00,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:00,902 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-01-11 11:01:00,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:00,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:00,943 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:00,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:00,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-11 11:01:00,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-11 11:01:01,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:01,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-11 11:01:01,349 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:01,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-11 11:01:01,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-11 11:01:01,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-11 11:01:01,350 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-01-11 11:01:01,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:01,448 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-01-11 11:01:01,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-11 11:01:01,448 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-01-11 11:01:01,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:01,449 INFO L225 Difference]: With dead ends: 55 [2019-01-11 11:01:01,449 INFO L226 Difference]: Without dead ends: 37 [2019-01-11 11:01:01,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-11 11:01:01,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-11 11:01:01,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-11 11:01:01,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-11 11:01:01,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-11 11:01:01,455 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-01-11 11:01:01,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:01,455 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-11 11:01:01,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-11 11:01:01,455 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-11 11:01:01,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-11 11:01:01,456 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:01,456 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-01-11 11:01:01,456 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:01,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:01,457 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-01-11 11:01:01,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:01,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:01,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:01,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:01,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-11 11:01:02,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:02,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:02,877 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:02,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:02,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:02,877 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-01-11 11:01:02,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:02,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:02,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:02,922 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-11 11:01:02,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-11 11:01:03,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:03,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-11 11:01:03,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:03,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-11 11:01:03,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-11 11:01:03,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-11 11:01:03,656 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-01-11 11:01:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:03,766 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-01-11 11:01:03,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-11 11:01:03,766 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-01-11 11:01:03,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:03,767 INFO L225 Difference]: With dead ends: 58 [2019-01-11 11:01:03,767 INFO L226 Difference]: Without dead ends: 39 [2019-01-11 11:01:03,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-11 11:01:03,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-11 11:01:03,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-11 11:01:03,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-11 11:01:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-11 11:01:03,772 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-01-11 11:01:03,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:03,772 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-11 11:01:03,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-11 11:01:03,772 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-11 11:01:03,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-11 11:01:03,773 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:03,773 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-01-11 11:01:03,774 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:03,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:03,774 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-01-11 11:01:03,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:03,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:03,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:03,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:03,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-11 11:01:04,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:04,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:04,055 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:04,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:04,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:04,055 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-01-11 11:01:04,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:04,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:04,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-11 11:01:04,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:04,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:04,121 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-11 11:01:04,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-11 11:01:04,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:04,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-11 11:01:04,988 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:04,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-11 11:01:04,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-11 11:01:04,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 11:01:04,989 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-01-11 11:01:05,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:05,076 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-01-11 11:01:05,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-11 11:01:05,077 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-01-11 11:01:05,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:05,078 INFO L225 Difference]: With dead ends: 61 [2019-01-11 11:01:05,078 INFO L226 Difference]: Without dead ends: 41 [2019-01-11 11:01:05,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 11:01:05,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-11 11:01:05,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-11 11:01:05,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-11 11:01:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-11 11:01:05,086 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-01-11 11:01:05,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:05,086 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-11 11:01:05,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-11 11:01:05,086 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-11 11:01:05,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-11 11:01:05,090 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:05,091 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-01-11 11:01:05,091 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:05,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:05,091 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-01-11 11:01:05,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:05,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:05,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:05,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:05,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-11 11:01:05,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:05,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:05,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:05,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:05,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:05,994 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-01-11 11:01:06,011 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:06,011 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:06,062 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:06,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:06,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-11 11:01:06,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:06,611 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-11 11:01:06,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:06,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-11 11:01:06,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:06,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-11 11:01:06,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-11 11:01:06,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-11 11:01:06,633 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-01-11 11:01:06,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:06,870 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-01-11 11:01:06,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-11 11:01:06,870 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-01-11 11:01:06,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:06,871 INFO L225 Difference]: With dead ends: 64 [2019-01-11 11:01:06,871 INFO L226 Difference]: Without dead ends: 43 [2019-01-11 11:01:06,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-11 11:01:06,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-11 11:01:06,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-11 11:01:06,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-11 11:01:06,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-11 11:01:06,875 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-01-11 11:01:06,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:06,875 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-11 11:01:06,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-11 11:01:06,876 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-11 11:01:06,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-11 11:01:06,876 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:06,876 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-01-11 11:01:06,876 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:06,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:06,877 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-01-11 11:01:06,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:06,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:06,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:06,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:06,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:07,561 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-11 11:01:07,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:07,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:07,562 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:07,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:07,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:07,562 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-01-11 11:01:07,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:07,571 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:07,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-11 11:01:07,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:08,116 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-11 11:01:08,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:08,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-11 11:01:08,136 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:08,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-11 11:01:08,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-11 11:01:08,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-11 11:01:08,137 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-01-11 11:01:08,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:08,217 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-11 11:01:08,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-11 11:01:08,218 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-01-11 11:01:08,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:08,218 INFO L225 Difference]: With dead ends: 67 [2019-01-11 11:01:08,219 INFO L226 Difference]: Without dead ends: 45 [2019-01-11 11:01:08,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-11 11:01:08,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-11 11:01:08,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-11 11:01:08,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-11 11:01:08,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-11 11:01:08,226 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-01-11 11:01:08,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:08,227 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-11 11:01:08,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-11 11:01:08,227 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-11 11:01:08,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-11 11:01:08,227 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:08,228 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-01-11 11:01:08,228 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:08,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:08,228 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-01-11 11:01:08,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:08,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:08,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:08,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:08,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-11 11:01:08,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:08,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:08,567 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:08,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:08,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:08,567 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-01-11 11:01:08,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:08,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:08,651 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-11 11:01:08,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:08,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-11 11:01:08,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-11 11:01:09,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:09,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-11 11:01:09,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:09,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-11 11:01:09,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-11 11:01:09,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-11 11:01:09,197 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-01-11 11:01:09,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:09,273 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-01-11 11:01:09,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-11 11:01:09,273 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-01-11 11:01:09,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:09,274 INFO L225 Difference]: With dead ends: 70 [2019-01-11 11:01:09,274 INFO L226 Difference]: Without dead ends: 47 [2019-01-11 11:01:09,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-11 11:01:09,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-11 11:01:09,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-11 11:01:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-11 11:01:09,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-11 11:01:09,279 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-01-11 11:01:09,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:09,280 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-11 11:01:09,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-11 11:01:09,280 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-11 11:01:09,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-11 11:01:09,281 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:09,281 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-01-11 11:01:09,281 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:09,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:09,281 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-01-11 11:01:09,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:09,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:09,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:09,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:09,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:09,762 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-11 11:01:09,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:09,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:09,762 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:09,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:09,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:09,763 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-01-11 11:01:09,771 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:09,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:09,810 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:09,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:09,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-11 11:01:09,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:10,390 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-11 11:01:10,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:10,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-11 11:01:10,411 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:10,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-11 11:01:10,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-11 11:01:10,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-11 11:01:10,412 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-01-11 11:01:10,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:10,495 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-01-11 11:01:10,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-11 11:01:10,498 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-01-11 11:01:10,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:10,499 INFO L225 Difference]: With dead ends: 73 [2019-01-11 11:01:10,499 INFO L226 Difference]: Without dead ends: 49 [2019-01-11 11:01:10,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-11 11:01:10,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-11 11:01:10,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-11 11:01:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-11 11:01:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-11 11:01:10,502 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-01-11 11:01:10,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:10,502 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-11 11:01:10,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-11 11:01:10,503 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-11 11:01:10,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-11 11:01:10,503 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:10,504 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-01-11 11:01:10,504 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:10,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:10,504 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-01-11 11:01:10,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:10,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:10,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:10,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:10,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-11 11:01:10,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:10,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:10,833 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:10,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:10,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:10,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 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-01-11 11:01:10,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:10,850 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:10,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:10,900 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-11 11:01:10,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:11,604 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-11 11:01:11,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:11,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-11 11:01:11,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:11,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-11 11:01:11,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-11 11:01:11,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-11 11:01:11,624 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-01-11 11:01:11,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:11,749 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-01-11 11:01:11,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-11 11:01:11,751 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-01-11 11:01:11,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:11,752 INFO L225 Difference]: With dead ends: 76 [2019-01-11 11:01:11,752 INFO L226 Difference]: Without dead ends: 51 [2019-01-11 11:01:11,753 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-01-11 11:01:11,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-11 11:01:11,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-11 11:01:11,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-11 11:01:11,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-01-11 11:01:11,756 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-01-11 11:01:11,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:11,756 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-01-11 11:01:11,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-11 11:01:11,757 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-01-11 11:01:11,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-11 11:01:11,757 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:11,757 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-01-11 11:01:11,758 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:11,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:11,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-01-11 11:01:11,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:11,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:11,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:11,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:11,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:12,117 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-11 11:01:12,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:12,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:12,117 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:12,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:12,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:12,118 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-01-11 11:01:12,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:12,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:12,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-11 11:01:12,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:12,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-11 11:01:12,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:13,108 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-11 11:01:13,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:13,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-01-11 11:01:13,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:13,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-11 11:01:13,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-11 11:01:13,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 11:01:13,130 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-01-11 11:01:13,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:13,226 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-01-11 11:01:13,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-11 11:01:13,226 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-01-11 11:01:13,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:13,227 INFO L225 Difference]: With dead ends: 79 [2019-01-11 11:01:13,227 INFO L226 Difference]: Without dead ends: 53 [2019-01-11 11:01:13,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 11:01:13,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-11 11:01:13,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-11 11:01:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-11 11:01:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-11 11:01:13,232 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-01-11 11:01:13,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:13,233 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-11 11:01:13,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-11 11:01:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-11 11:01:13,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-11 11:01:13,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:13,233 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-01-11 11:01:13,233 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:13,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:13,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-01-11 11:01:13,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:13,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:13,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:13,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:13,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:13,778 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-11 11:01:13,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:13,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:13,778 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:13,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:13,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:13,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 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-01-11 11:01:13,786 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:13,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:13,835 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:13,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:13,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:13,845 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-11 11:01:13,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-11 11:01:14,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:14,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-11 11:01:14,606 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:14,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-11 11:01:14,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-11 11:01:14,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-11 11:01:14,607 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-01-11 11:01:14,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:14,714 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-01-11 11:01:14,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-11 11:01:14,715 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-01-11 11:01:14,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:14,716 INFO L225 Difference]: With dead ends: 82 [2019-01-11 11:01:14,716 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 11:01:14,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-11 11:01:14,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 11:01:14,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-11 11:01:14,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-11 11:01:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-01-11 11:01:14,720 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-01-11 11:01:14,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:14,721 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-01-11 11:01:14,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-11 11:01:14,721 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-01-11 11:01:14,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-11 11:01:14,721 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:14,722 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-01-11 11:01:14,722 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:14,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:14,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-01-11 11:01:14,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:14,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:14,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:14,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:14,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:15,515 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-11 11:01:15,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:15,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:15,515 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:15,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:15,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:15,516 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-01-11 11:01:15,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:15,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:15,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-11 11:01:15,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:16,727 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-11 11:01:16,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:16,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-11 11:01:16,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:16,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-11 11:01:16,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-11 11:01:16,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-11 11:01:16,747 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-01-11 11:01:16,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:16,831 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-01-11 11:01:16,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-11 11:01:16,832 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-01-11 11:01:16,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:16,833 INFO L225 Difference]: With dead ends: 85 [2019-01-11 11:01:16,833 INFO L226 Difference]: Without dead ends: 57 [2019-01-11 11:01:16,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-11 11:01:16,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-11 11:01:16,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-11 11:01:16,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-11 11:01:16,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-11 11:01:16,837 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-01-11 11:01:16,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:16,837 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-11 11:01:16,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-11 11:01:16,837 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-11 11:01:16,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-11 11:01:16,838 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:16,838 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-01-11 11:01:16,838 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:16,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:16,839 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-01-11 11:01:16,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:16,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:16,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:16,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:16,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-11 11:01:17,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:17,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:17,773 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:17,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:17,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:17,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:01:17,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:17,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:17,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-11 11:01:17,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:17,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:17,896 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-11 11:01:17,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-11 11:01:18,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:18,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-01-11 11:01:18,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:18,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-11 11:01:18,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-11 11:01:18,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-11 11:01:18,831 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-01-11 11:01:18,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:18,934 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-01-11 11:01:18,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-11 11:01:18,935 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-01-11 11:01:18,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:18,936 INFO L225 Difference]: With dead ends: 88 [2019-01-11 11:01:18,936 INFO L226 Difference]: Without dead ends: 59 [2019-01-11 11:01:18,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-11 11:01:18,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-11 11:01:18,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-11 11:01:18,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-11 11:01:18,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-11 11:01:18,941 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-01-11 11:01:18,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:18,941 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-11 11:01:18,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-11 11:01:18,941 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-11 11:01:18,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-11 11:01:18,942 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:18,942 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-01-11 11:01:18,942 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:18,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:18,942 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-01-11 11:01:18,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:18,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:18,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:18,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:18,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:19,539 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-11 11:01:19,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:19,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:19,540 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:19,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:19,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:19,540 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-01-11 11:01:19,548 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:19,549 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:19,586 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:19,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:19,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-11 11:01:19,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:20,648 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-11 11:01:20,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:20,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-11 11:01:20,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:20,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-11 11:01:20,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-11 11:01:20,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-11 11:01:20,669 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-01-11 11:01:20,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:20,793 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-01-11 11:01:20,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-11 11:01:20,794 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-01-11 11:01:20,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:20,794 INFO L225 Difference]: With dead ends: 91 [2019-01-11 11:01:20,794 INFO L226 Difference]: Without dead ends: 61 [2019-01-11 11:01:20,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-11 11:01:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-11 11:01:20,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-11 11:01:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 11:01:20,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-01-11 11:01:20,798 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-01-11 11:01:20,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:20,799 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-01-11 11:01:20,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-11 11:01:20,799 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-01-11 11:01:20,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-11 11:01:20,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:20,800 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-01-11 11:01:20,800 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:20,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:20,800 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-01-11 11:01:20,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:20,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:20,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:20,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:20,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-11 11:01:21,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:21,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:21,208 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:21,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:21,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:21,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:01:21,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:21,220 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:21,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-11 11:01:21,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:22,432 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-11 11:01:22,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:22,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-11 11:01:22,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:22,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-11 11:01:22,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-11 11:01:22,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-11 11:01:22,452 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-01-11 11:01:22,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:22,607 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-01-11 11:01:22,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-11 11:01:22,608 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-01-11 11:01:22,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:22,608 INFO L225 Difference]: With dead ends: 94 [2019-01-11 11:01:22,608 INFO L226 Difference]: Without dead ends: 63 [2019-01-11 11:01:22,609 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-01-11 11:01:22,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-11 11:01:22,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-11 11:01:22,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-11 11:01:22,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-01-11 11:01:22,612 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-01-11 11:01:22,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:22,613 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-01-11 11:01:22,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-11 11:01:22,613 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-01-11 11:01:22,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-11 11:01:22,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:22,613 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-01-11 11:01:22,614 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:22,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:22,614 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-01-11 11:01:22,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:22,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:22,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:22,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:22,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-11 11:01:23,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:23,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:23,168 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:23,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:23,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:23,169 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-01-11 11:01:23,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:23,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:23,335 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-11 11:01:23,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:23,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-11 11:01:23,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-11 11:01:24,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:24,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-01-11 11:01:24,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:24,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-11 11:01:24,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-11 11:01:24,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-11 11:01:24,313 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-01-11 11:01:24,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:24,418 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-01-11 11:01:24,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-11 11:01:24,419 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-01-11 11:01:24,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:24,419 INFO L225 Difference]: With dead ends: 97 [2019-01-11 11:01:24,420 INFO L226 Difference]: Without dead ends: 65 [2019-01-11 11:01:24,421 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-01-11 11:01:24,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-11 11:01:24,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-11 11:01:24,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-11 11:01:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-11 11:01:24,424 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-01-11 11:01:24,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:24,424 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-11 11:01:24,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-11 11:01:24,424 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-11 11:01:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-11 11:01:24,424 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:24,424 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-01-11 11:01:24,425 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:24,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:24,425 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-01-11 11:01:24,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:24,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:24,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:24,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:24,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-11 11:01:24,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:24,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:24,868 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:24,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:24,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:24,868 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-01-11 11:01:24,878 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:24,878 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:24,927 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:24,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:24,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-11 11:01:24,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-11 11:01:25,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:25,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-11 11:01:25,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:25,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-11 11:01:25,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-11 11:01:25,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-11 11:01:25,984 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-01-11 11:01:26,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:26,127 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-01-11 11:01:26,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-11 11:01:26,128 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-01-11 11:01:26,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:26,129 INFO L225 Difference]: With dead ends: 100 [2019-01-11 11:01:26,129 INFO L226 Difference]: Without dead ends: 67 [2019-01-11 11:01:26,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-11 11:01:26,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-11 11:01:26,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-11 11:01:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-11 11:01:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-01-11 11:01:26,133 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-01-11 11:01:26,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:26,133 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-01-11 11:01:26,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-11 11:01:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-01-11 11:01:26,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-11 11:01:26,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:26,134 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-01-11 11:01:26,134 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:26,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:26,135 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-01-11 11:01:26,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:26,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:26,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:26,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:26,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-11 11:01:26,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:26,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:26,623 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:26,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:26,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:26,624 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-01-11 11:01:26,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:26,632 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:26,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-11 11:01:26,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:28,086 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-11 11:01:28,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:28,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-11 11:01:28,106 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:28,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-11 11:01:28,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-11 11:01:28,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-11 11:01:28,108 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-01-11 11:01:28,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:28,241 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-01-11 11:01:28,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-11 11:01:28,242 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-01-11 11:01:28,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:28,242 INFO L225 Difference]: With dead ends: 103 [2019-01-11 11:01:28,243 INFO L226 Difference]: Without dead ends: 69 [2019-01-11 11:01:28,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-11 11:01:28,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-11 11:01:28,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-11 11:01:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-11 11:01:28,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-11 11:01:28,247 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-01-11 11:01:28,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:28,247 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-11 11:01:28,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-11 11:01:28,247 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-11 11:01:28,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-11 11:01:28,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:28,248 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-01-11 11:01:28,248 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:28,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:28,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-01-11 11:01:28,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:28,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:28,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:28,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:28,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-11 11:01:29,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:29,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:29,279 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:29,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:29,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:29,279 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-01-11 11:01:29,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:29,288 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:29,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-11 11:01:29,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:29,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:29,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-11 11:01:29,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-11 11:01:30,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:30,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-11 11:01:30,647 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:30,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-11 11:01:30,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-11 11:01:30,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-11 11:01:30,648 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-01-11 11:01:30,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:30,792 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-01-11 11:01:30,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-11 11:01:30,792 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-01-11 11:01:30,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:30,793 INFO L225 Difference]: With dead ends: 106 [2019-01-11 11:01:30,793 INFO L226 Difference]: Without dead ends: 71 [2019-01-11 11:01:30,794 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-01-11 11:01:30,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-11 11:01:30,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-11 11:01:30,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-11 11:01:30,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-11 11:01:30,797 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-01-11 11:01:30,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:30,797 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-11 11:01:30,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-11 11:01:30,798 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-11 11:01:30,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-11 11:01:30,798 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:30,798 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-01-11 11:01:30,798 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:30,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:30,799 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-01-11 11:01:30,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:30,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:30,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:30,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:30,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-11 11:01:31,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:31,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:31,319 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:31,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:31,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:31,319 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-01-11 11:01:31,329 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:31,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:31,376 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:31,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:31,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-11 11:01:31,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-11 11:01:32,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:32,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-11 11:01:32,688 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:32,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-11 11:01:32,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-11 11:01:32,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-11 11:01:32,689 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-01-11 11:01:32,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:32,922 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-01-11 11:01:32,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-11 11:01:32,922 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-01-11 11:01:32,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:32,923 INFO L225 Difference]: With dead ends: 109 [2019-01-11 11:01:32,923 INFO L226 Difference]: Without dead ends: 73 [2019-01-11 11:01:32,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-11 11:01:32,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-11 11:01:32,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-11 11:01:32,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-11 11:01:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-01-11 11:01:32,925 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-01-11 11:01:32,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:32,926 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-01-11 11:01:32,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-11 11:01:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-01-11 11:01:32,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-11 11:01:32,926 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:32,926 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-01-11 11:01:32,927 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:32,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:32,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-01-11 11:01:32,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:32,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:32,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:32,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:32,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:33,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-11 11:01:33,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:33,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:33,615 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:33,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:33,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:33,616 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-01-11 11:01:33,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:33,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:33,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:33,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-11 11:01:33,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:34,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-11 11:01:34,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:34,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-11 11:01:34,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:34,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-11 11:01:34,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-11 11:01:34,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-11 11:01:35,000 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-01-11 11:01:35,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:35,236 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-01-11 11:01:35,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-11 11:01:35,237 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-01-11 11:01:35,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:35,238 INFO L225 Difference]: With dead ends: 112 [2019-01-11 11:01:35,238 INFO L226 Difference]: Without dead ends: 75 [2019-01-11 11:01:35,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-11 11:01:35,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-11 11:01:35,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-11 11:01:35,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-11 11:01:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-01-11 11:01:35,242 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-01-11 11:01:35,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:35,243 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-01-11 11:01:35,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-11 11:01:35,243 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-01-11 11:01:35,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-11 11:01:35,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:35,243 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-01-11 11:01:35,244 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:35,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:35,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-01-11 11:01:35,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:35,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:35,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:35,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:35,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:35,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-11 11:01:35,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:35,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:35,914 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:35,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:35,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:35,914 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-01-11 11:01:35,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:35,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:36,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-11 11:01:36,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:36,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:36,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-11 11:01:36,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:37,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-11 11:01:37,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:37,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-11 11:01:37,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:37,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-11 11:01:37,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-11 11:01:37,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-11 11:01:37,726 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-01-11 11:01:37,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:37,879 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-01-11 11:01:37,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-11 11:01:37,879 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-01-11 11:01:37,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:37,880 INFO L225 Difference]: With dead ends: 115 [2019-01-11 11:01:37,880 INFO L226 Difference]: Without dead ends: 77 [2019-01-11 11:01:37,880 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-01-11 11:01:37,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-11 11:01:37,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-11 11:01:37,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-11 11:01:37,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-11 11:01:37,883 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-01-11 11:01:37,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:37,884 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-11 11:01:37,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-11 11:01:37,884 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-11 11:01:37,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-11 11:01:37,885 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:37,885 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-01-11 11:01:37,885 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:37,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:37,885 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-01-11 11:01:37,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:37,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:37,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:37,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:37,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:38,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-11 11:01:38,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:38,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:38,515 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:38,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:38,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:38,515 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-01-11 11:01:38,524 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:38,524 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:38,583 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:38,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:38,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:38,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-11 11:01:38,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-11 11:01:40,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:40,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-11 11:01:40,109 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:40,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-11 11:01:40,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-11 11:01:40,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-11 11:01:40,110 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-01-11 11:01:40,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:40,251 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-01-11 11:01:40,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-11 11:01:40,251 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-01-11 11:01:40,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:40,252 INFO L225 Difference]: With dead ends: 118 [2019-01-11 11:01:40,252 INFO L226 Difference]: Without dead ends: 79 [2019-01-11 11:01:40,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-11 11:01:40,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-11 11:01:40,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-11 11:01:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-11 11:01:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-01-11 11:01:40,257 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-01-11 11:01:40,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:40,257 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-01-11 11:01:40,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-11 11:01:40,257 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-01-11 11:01:40,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-11 11:01:40,258 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:40,258 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-01-11 11:01:40,258 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:40,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:40,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-01-11 11:01:40,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:40,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:40,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:40,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:40,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:41,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-11 11:01:41,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:41,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:41,123 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:41,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:41,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:41,123 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-01-11 11:01:41,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:41,133 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:41,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-11 11:01:41,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-11 11:01:42,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:42,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-11 11:01:42,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:42,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-11 11:01:42,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-11 11:01:42,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-11 11:01:42,892 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-01-11 11:01:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:43,080 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-01-11 11:01:43,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-11 11:01:43,080 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-01-11 11:01:43,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:43,081 INFO L225 Difference]: With dead ends: 121 [2019-01-11 11:01:43,081 INFO L226 Difference]: Without dead ends: 81 [2019-01-11 11:01:43,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-11 11:01:43,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-11 11:01:43,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-11 11:01:43,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-11 11:01:43,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-01-11 11:01:43,084 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-01-11 11:01:43,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:43,085 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-01-11 11:01:43,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-11 11:01:43,085 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-01-11 11:01:43,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-11 11:01:43,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:43,085 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-01-11 11:01:43,085 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:43,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:43,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-01-11 11:01:43,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:43,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:43,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:43,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:43,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:43,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-11 11:01:43,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:43,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:43,854 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:43,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:43,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:43,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:01:43,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:43,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:44,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-11 11:01:44,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:44,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:44,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-11 11:01:44,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:46,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-11 11:01:46,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:46,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-11 11:01:46,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:46,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-11 11:01:46,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-11 11:01:46,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-11 11:01:46,158 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-01-11 11:01:46,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:46,296 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-01-11 11:01:46,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-11 11:01:46,297 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-01-11 11:01:46,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:46,298 INFO L225 Difference]: With dead ends: 124 [2019-01-11 11:01:46,298 INFO L226 Difference]: Without dead ends: 83 [2019-01-11 11:01:46,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-11 11:01:46,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-11 11:01:46,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-11 11:01:46,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-11 11:01:46,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-01-11 11:01:46,302 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-01-11 11:01:46,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:46,302 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-01-11 11:01:46,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-11 11:01:46,302 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-01-11 11:01:46,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-11 11:01:46,302 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:46,302 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-01-11 11:01:46,303 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:46,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:46,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-01-11 11:01:46,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:46,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:46,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:46,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:46,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:47,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-11 11:01:47,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:47,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:47,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:47,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:47,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:47,024 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-01-11 11:01:47,033 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:47,033 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:47,103 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:47,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:47,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-11 11:01:47,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:49,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-11 11:01:49,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:49,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-11 11:01:49,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:49,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-11 11:01:49,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-11 11:01:49,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-11 11:01:49,148 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-01-11 11:01:49,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:49,289 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-01-11 11:01:49,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-11 11:01:49,290 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-01-11 11:01:49,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:49,291 INFO L225 Difference]: With dead ends: 127 [2019-01-11 11:01:49,291 INFO L226 Difference]: Without dead ends: 85 [2019-01-11 11:01:49,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-11 11:01:49,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-11 11:01:49,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-11 11:01:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-11 11:01:49,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-01-11 11:01:49,296 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-01-11 11:01:49,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:49,296 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-01-11 11:01:49,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-11 11:01:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-01-11 11:01:49,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-11 11:01:49,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:49,297 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-01-11 11:01:49,297 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:49,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:49,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-01-11 11:01:49,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:49,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:49,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:49,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:49,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:50,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-11 11:01:50,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:50,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:50,327 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:50,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:50,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:50,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 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-01-11 11:01:50,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:50,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:50,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-11 11:01:50,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:52,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-11 11:01:52,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:52,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-11 11:01:52,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:52,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-11 11:01:52,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-11 11:01:52,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-11 11:01:52,165 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-01-11 11:01:52,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:52,330 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-01-11 11:01:52,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-11 11:01:52,331 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-01-11 11:01:52,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:52,331 INFO L225 Difference]: With dead ends: 130 [2019-01-11 11:01:52,331 INFO L226 Difference]: Without dead ends: 87 [2019-01-11 11:01:52,332 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-01-11 11:01:52,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-11 11:01:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-11 11:01:52,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-11 11:01:52,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-01-11 11:01:52,335 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-01-11 11:01:52,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:52,336 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-01-11 11:01:52,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-11 11:01:52,336 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-01-11 11:01:52,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-11 11:01:52,336 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:52,337 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-01-11 11:01:52,337 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:52,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:52,337 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-01-11 11:01:52,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:52,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:52,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:52,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:52,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:53,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-11 11:01:53,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:53,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:53,759 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:53,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:53,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:53,759 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-01-11 11:01:53,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:53,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:54,089 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-11 11:01:54,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:54,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:54,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-11 11:01:54,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:55,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-11 11:01:55,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:55,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-11 11:01:55,925 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:55,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-11 11:01:55,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-11 11:01:55,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 11:01:55,927 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-01-11 11:01:56,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:56,092 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-01-11 11:01:56,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-11 11:01:56,093 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-01-11 11:01:56,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:56,093 INFO L225 Difference]: With dead ends: 133 [2019-01-11 11:01:56,093 INFO L226 Difference]: Without dead ends: 89 [2019-01-11 11:01:56,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 11:01:56,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-11 11:01:56,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-11 11:01:56,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-11 11:01:56,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-01-11 11:01:56,097 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-01-11 11:01:56,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:56,097 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-01-11 11:01:56,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-11 11:01:56,098 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-01-11 11:01:56,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-11 11:01:56,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:56,098 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-01-11 11:01:56,099 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:56,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:56,099 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-01-11 11:01:56,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:56,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:56,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:56,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:56,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:57,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-11 11:01:57,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:57,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:57,928 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:57,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:57,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:57,928 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-01-11 11:01:57,936 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:57,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:57,998 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:57,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:58,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:58,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-11 11:01:58,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:00,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-11 11:02:00,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:00,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-11 11:02:00,355 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:00,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-11 11:02:00,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-11 11:02:00,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-11 11:02:00,356 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-01-11 11:02:00,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:00,530 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-01-11 11:02:00,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-11 11:02:00,531 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-01-11 11:02:00,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:00,531 INFO L225 Difference]: With dead ends: 136 [2019-01-11 11:02:00,531 INFO L226 Difference]: Without dead ends: 91 [2019-01-11 11:02:00,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-11 11:02:00,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-11 11:02:00,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-11 11:02:00,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-11 11:02:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-01-11 11:02:00,534 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-01-11 11:02:00,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:00,535 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-01-11 11:02:00,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-11 11:02:00,535 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-01-11 11:02:00,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-11 11:02:00,535 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:00,536 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-01-11 11:02:00,536 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:00,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:00,536 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-01-11 11:02:00,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:00,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:00,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:00,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:00,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:01,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-11 11:02:01,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:01,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:01,414 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:01,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:01,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:01,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:02:01,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:01,422 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:02:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:01,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-11 11:02:01,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:03,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-11 11:02:03,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:03,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-11 11:02:03,755 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:03,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-11 11:02:03,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-11 11:02:03,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-11 11:02:03,758 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-01-11 11:02:04,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:04,023 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-01-11 11:02:04,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-11 11:02:04,024 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-01-11 11:02:04,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:04,025 INFO L225 Difference]: With dead ends: 139 [2019-01-11 11:02:04,025 INFO L226 Difference]: Without dead ends: 93 [2019-01-11 11:02:04,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-11 11:02:04,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-11 11:02:04,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-11 11:02:04,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-11 11:02:04,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-01-11 11:02:04,028 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-01-11 11:02:04,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:04,028 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-01-11 11:02:04,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-11 11:02:04,028 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-01-11 11:02:04,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-11 11:02:04,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:04,029 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-01-11 11:02:04,029 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:04,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:04,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-01-11 11:02:04,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:04,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:04,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:04,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:04,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:05,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-11 11:02:05,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:05,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:05,034 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:05,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:05,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:05,034 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-01-11 11:02:05,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:02:05,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:02:05,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-11 11:02:05,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:05,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:05,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-11 11:02:05,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-11 11:02:07,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:07,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-01-11 11:02:07,639 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:07,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-11 11:02:07,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-11 11:02:07,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-11 11:02:07,640 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-01-11 11:02:08,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:08,636 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-01-11 11:02:08,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-11 11:02:08,637 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-01-11 11:02:08,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:08,637 INFO L225 Difference]: With dead ends: 142 [2019-01-11 11:02:08,637 INFO L226 Difference]: Without dead ends: 95 [2019-01-11 11:02:08,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-11 11:02:08,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-11 11:02:08,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-11 11:02:08,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-11 11:02:08,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-01-11 11:02:08,640 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-01-11 11:02:08,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:08,640 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-01-11 11:02:08,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-11 11:02:08,640 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-01-11 11:02:08,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-11 11:02:08,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:08,641 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-01-11 11:02:08,641 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:08,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:08,641 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-01-11 11:02:08,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:08,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:08,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:08,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:08,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-11 11:02:10,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:10,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:10,163 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:10,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:10,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:10,163 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-01-11 11:02:10,179 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:02:10,179 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:02:10,261 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:02:10,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:10,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-11 11:02:10,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:12,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-11 11:02:12,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:12,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-11 11:02:12,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:12,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-11 11:02:12,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-11 11:02:12,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-11 11:02:12,539 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-01-11 11:02:12,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:12,743 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-01-11 11:02:12,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-11 11:02:12,746 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-01-11 11:02:12,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:12,747 INFO L225 Difference]: With dead ends: 145 [2019-01-11 11:02:12,747 INFO L226 Difference]: Without dead ends: 97 [2019-01-11 11:02:12,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-11 11:02:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-11 11:02:12,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-11 11:02:12,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-11 11:02:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-01-11 11:02:12,751 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-01-11 11:02:12,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:12,752 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-01-11 11:02:12,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-11 11:02:12,752 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-01-11 11:02:12,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-11 11:02:12,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:12,753 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-01-11 11:02:12,753 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:12,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:12,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-01-11 11:02:12,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:12,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:12,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:12,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:12,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-11 11:02:13,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:13,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:13,943 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:13,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:13,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:13,943 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-01-11 11:02:13,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:13,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:02:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:14,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:14,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-11 11:02:14,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:16,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-11 11:02:16,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:16,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-11 11:02:16,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:16,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-11 11:02:16,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-11 11:02:16,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-11 11:02:16,376 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-01-11 11:02:16,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:16,550 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-01-11 11:02:16,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-11 11:02:16,550 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-01-11 11:02:16,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:16,551 INFO L225 Difference]: With dead ends: 148 [2019-01-11 11:02:16,552 INFO L226 Difference]: Without dead ends: 99 [2019-01-11 11:02:16,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-11 11:02:16,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-11 11:02:16,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-11 11:02:16,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-11 11:02:16,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-01-11 11:02:16,556 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-01-11 11:02:16,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:16,556 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-01-11 11:02:16,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-11 11:02:16,556 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-01-11 11:02:16,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-11 11:02:16,557 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:16,557 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-01-11 11:02:16,557 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:16,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:16,558 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-01-11 11:02:16,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:16,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:16,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:16,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:16,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-11 11:02:17,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:17,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:17,538 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:17,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:17,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:17,539 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-01-11 11:02:17,547 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:02:17,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:02:18,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-11 11:02:18,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:18,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-11 11:02:18,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-11 11:02:21,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:21,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-11 11:02:21,626 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:21,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-11 11:02:21,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-11 11:02:21,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-11 11:02:21,627 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-01-11 11:02:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:21,809 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-01-11 11:02:21,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-11 11:02:21,809 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-01-11 11:02:21,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:21,810 INFO L225 Difference]: With dead ends: 151 [2019-01-11 11:02:21,810 INFO L226 Difference]: Without dead ends: 101 [2019-01-11 11:02:21,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-11 11:02:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-11 11:02:21,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-11 11:02:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-11 11:02:21,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-01-11 11:02:21,813 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-01-11 11:02:21,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:21,814 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-01-11 11:02:21,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-11 11:02:21,814 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-01-11 11:02:21,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-11 11:02:21,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:21,814 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-01-11 11:02:21,814 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:21,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:21,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-01-11 11:02:21,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:21,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:21,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:21,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:21,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:22,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-11 11:02:22,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:22,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:22,898 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:22,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:22,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:22,898 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-01-11 11:02:22,907 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:02:22,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:02:22,980 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:02:22,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:22,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:23,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-11 11:02:23,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:25,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-11 11:02:25,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:25,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-11 11:02:25,717 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:25,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-11 11:02:25,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-11 11:02:25,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-11 11:02:25,719 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-01-11 11:02:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:26,050 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-01-11 11:02:26,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-11 11:02:26,051 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-01-11 11:02:26,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:26,051 INFO L225 Difference]: With dead ends: 154 [2019-01-11 11:02:26,051 INFO L226 Difference]: Without dead ends: 103 [2019-01-11 11:02:26,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-11 11:02:26,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-11 11:02:26,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-11 11:02:26,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-11 11:02:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-01-11 11:02:26,055 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-01-11 11:02:26,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:26,056 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-01-11 11:02:26,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-11 11:02:26,056 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-01-11 11:02:26,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-11 11:02:26,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:26,056 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-01-11 11:02:26,057 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:26,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:26,057 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-01-11 11:02:26,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:26,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:26,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:26,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:26,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-11 11:02:27,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:27,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:27,069 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:27,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:27,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:27,070 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-01-11 11:02:27,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:27,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:02:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:27,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-11 11:02:27,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:30,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-11 11:02:30,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:30,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-11 11:02:30,100 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:30,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-11 11:02:30,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-11 11:02:30,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-11 11:02:30,102 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-01-11 11:02:30,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:30,323 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-01-11 11:02:30,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-11 11:02:30,323 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-01-11 11:02:30,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:30,324 INFO L225 Difference]: With dead ends: 157 [2019-01-11 11:02:30,324 INFO L226 Difference]: Without dead ends: 105 [2019-01-11 11:02:30,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-11 11:02:30,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-11 11:02:30,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-11 11:02:30,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-11 11:02:30,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-01-11 11:02:30,328 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-01-11 11:02:30,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:30,329 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-01-11 11:02:30,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-11 11:02:30,329 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-01-11 11:02:30,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-11 11:02:30,329 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:30,330 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-01-11 11:02:30,330 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:30,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:30,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-01-11 11:02:30,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:30,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:30,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:30,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:30,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:31,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-11 11:02:31,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:31,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:31,344 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:31,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:31,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:31,345 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-01-11 11:02:31,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:02:31,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:02:32,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-11 11:02:32,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:32,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:32,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-11 11:02:32,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:35,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-11 11:02:35,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:35,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-11 11:02:35,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:35,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-11 11:02:35,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-11 11:02:35,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-11 11:02:35,743 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-01-11 11:02:36,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:36,406 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-01-11 11:02:36,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-11 11:02:36,407 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-01-11 11:02:36,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:36,408 INFO L225 Difference]: With dead ends: 160 [2019-01-11 11:02:36,408 INFO L226 Difference]: Without dead ends: 107 [2019-01-11 11:02:36,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-11 11:02:36,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-11 11:02:36,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-11 11:02:36,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-11 11:02:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-01-11 11:02:36,411 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-01-11 11:02:36,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:36,412 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-01-11 11:02:36,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-11 11:02:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-01-11 11:02:36,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-11 11:02:36,413 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:36,413 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-01-11 11:02:36,413 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:36,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:36,413 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-01-11 11:02:36,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:36,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:36,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:36,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:36,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:37,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-11 11:02:37,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:37,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:37,538 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:37,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:37,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:37,538 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-01-11 11:02:37,548 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:02:37,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:02:37,621 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:02:37,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:37,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:37,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-11 11:02:37,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:40,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-11 11:02:40,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:40,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-11 11:02:40,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:40,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-11 11:02:40,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-11 11:02:40,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-11 11:02:40,496 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-01-11 11:02:40,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:40,733 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-01-11 11:02:40,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-11 11:02:40,734 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-01-11 11:02:40,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:40,734 INFO L225 Difference]: With dead ends: 163 [2019-01-11 11:02:40,734 INFO L226 Difference]: Without dead ends: 109 [2019-01-11 11:02:40,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-11 11:02:40,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-11 11:02:40,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-11 11:02:40,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-11 11:02:40,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-01-11 11:02:40,741 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-01-11 11:02:40,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:40,742 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-01-11 11:02:40,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-11 11:02:40,742 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-01-11 11:02:40,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-11 11:02:40,743 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:40,743 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-01-11 11:02:40,743 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:40,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:40,743 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-01-11 11:02:40,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:40,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:40,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:40,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:40,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:43,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-11 11:02:43,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:43,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:43,216 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:43,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:43,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:43,217 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-01-11 11:02:43,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:43,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:02:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:43,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:43,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-11 11:02:43,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:46,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-11 11:02:46,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:46,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-11 11:02:46,447 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:46,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-11 11:02:46,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-11 11:02:46,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-11 11:02:46,449 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-01-11 11:02:46,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:46,668 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-01-11 11:02:46,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-11 11:02:46,669 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-01-11 11:02:46,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:46,669 INFO L225 Difference]: With dead ends: 166 [2019-01-11 11:02:46,669 INFO L226 Difference]: Without dead ends: 111 [2019-01-11 11:02:46,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-11 11:02:46,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-11 11:02:46,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-11 11:02:46,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-11 11:02:46,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-01-11 11:02:46,672 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-01-11 11:02:46,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:46,673 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-01-11 11:02:46,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-11 11:02:46,673 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-01-11 11:02:46,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-11 11:02:46,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:46,673 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-01-11 11:02:46,674 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:46,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:46,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-01-11 11:02:46,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:46,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:46,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:46,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:46,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:47,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-11 11:02:47,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:47,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:47,835 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:47,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:47,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:47,836 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-01-11 11:02:47,844 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:02:47,844 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:02:49,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-11 11:02:49,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:49,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-11 11:02:49,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:52,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-11 11:02:52,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:52,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-01-11 11:02:52,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:52,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-11 11:02:52,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-11 11:02:52,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-11 11:02:52,285 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2019-01-11 11:02:52,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:52,530 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2019-01-11 11:02:52,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-11 11:02:52,530 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-01-11 11:02:52,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:52,531 INFO L225 Difference]: With dead ends: 169 [2019-01-11 11:02:52,531 INFO L226 Difference]: Without dead ends: 113 [2019-01-11 11:02:52,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-11 11:02:52,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-11 11:02:52,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-11 11:02:52,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-11 11:02:52,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-01-11 11:02:52,534 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2019-01-11 11:02:52,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:52,534 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-01-11 11:02:52,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-11 11:02:52,535 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-01-11 11:02:52,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-11 11:02:52,535 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:52,535 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2019-01-11 11:02:52,536 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:52,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:52,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2019-01-11 11:02:52,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:52,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:52,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:52,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:52,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:54,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-11 11:02:54,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:54,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:54,192 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:54,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:54,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:54,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:54,202 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:02:54,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:02:54,282 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:02:54,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:54,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-11 11:02:54,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-11 11:02:57,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:57,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-01-11 11:02:57,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:57,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-11 11:02:57,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-11 11:02:57,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-11 11:02:57,715 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2019-01-11 11:02:57,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:57,939 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2019-01-11 11:02:57,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-11 11:02:57,940 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-01-11 11:02:57,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:57,941 INFO L225 Difference]: With dead ends: 172 [2019-01-11 11:02:57,941 INFO L226 Difference]: Without dead ends: 115 [2019-01-11 11:02:57,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-11 11:02:57,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-11 11:02:57,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-01-11 11:02:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-11 11:02:57,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-01-11 11:02:57,944 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2019-01-11 11:02:57,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:57,945 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-01-11 11:02:57,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-11 11:02:57,945 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-01-11 11:02:57,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-11 11:02:57,946 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:57,946 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2019-01-11 11:02:57,946 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:57,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:57,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2019-01-11 11:02:57,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:57,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:57,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:57,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:57,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-11 11:02:59,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:59,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:59,214 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:59,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:59,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:59,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:59,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:59,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:02:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:59,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-11 11:02:59,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:03,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-11 11:03:03,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:03,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-01-11 11:03:03,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:03,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-11 11:03:03,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-11 11:03:03,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-11 11:03:03,109 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2019-01-11 11:03:03,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:03,514 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2019-01-11 11:03:03,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-11 11:03:03,514 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2019-01-11 11:03:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:03,515 INFO L225 Difference]: With dead ends: 175 [2019-01-11 11:03:03,515 INFO L226 Difference]: Without dead ends: 117 [2019-01-11 11:03:03,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-11 11:03:03,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-11 11:03:03,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-01-11 11:03:03,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-11 11:03:03,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-01-11 11:03:03,521 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-01-11 11:03:03,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:03,521 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-01-11 11:03:03,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-11 11:03:03,521 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-01-11 11:03:03,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-11 11:03:03,522 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:03,522 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2019-01-11 11:03:03,522 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:03,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:03,523 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2019-01-11 11:03:03,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:03,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:03,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:03,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:03,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:04,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-11 11:03:04,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:04,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:04,756 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:04,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:04,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:04,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:04,767 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:03:04,767 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:03:05,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-11 11:03:05,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:05,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-11 11:03:05,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:09,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-11 11:03:09,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:09,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-01-11 11:03:09,067 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:09,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-11 11:03:09,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-11 11:03:09,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-11 11:03:09,069 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2019-01-11 11:03:09,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:09,368 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2019-01-11 11:03:09,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-11 11:03:09,369 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2019-01-11 11:03:09,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:09,369 INFO L225 Difference]: With dead ends: 178 [2019-01-11 11:03:09,369 INFO L226 Difference]: Without dead ends: 119 [2019-01-11 11:03:09,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-11 11:03:09,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-11 11:03:09,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-01-11 11:03:09,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-11 11:03:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-01-11 11:03:09,372 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2019-01-11 11:03:09,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:09,373 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-01-11 11:03:09,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-11 11:03:09,373 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-01-11 11:03:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-11 11:03:09,374 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:09,374 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2019-01-11 11:03:09,374 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:09,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:09,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2019-01-11 11:03:09,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:09,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:09,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:09,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:09,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:11,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-11 11:03:11,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:11,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:11,045 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:11,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:11,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:11,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:11,054 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:03:11,054 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:03:11,131 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:03:11,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:11,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-11 11:03:11,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:14,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-11 11:03:14,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:14,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-01-11 11:03:14,567 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:14,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-11 11:03:14,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-11 11:03:14,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-11 11:03:14,569 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2019-01-11 11:03:14,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:14,838 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2019-01-11 11:03:14,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-11 11:03:14,839 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2019-01-11 11:03:14,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:14,839 INFO L225 Difference]: With dead ends: 181 [2019-01-11 11:03:14,839 INFO L226 Difference]: Without dead ends: 121 [2019-01-11 11:03:14,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-11 11:03:14,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-11 11:03:14,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-01-11 11:03:14,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-11 11:03:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-01-11 11:03:14,843 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2019-01-11 11:03:14,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:14,843 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-01-11 11:03:14,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-11 11:03:14,843 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-01-11 11:03:14,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-11 11:03:14,844 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:14,844 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2019-01-11 11:03:14,844 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:14,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:14,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2019-01-11 11:03:14,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:14,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:14,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:14,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:14,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-11 11:03:16,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:16,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:16,580 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:16,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:16,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:16,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:16,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:16,591 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:03:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:16,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-11 11:03:16,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-11 11:03:20,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:20,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-01-11 11:03:20,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:20,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-11 11:03:20,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-11 11:03:20,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-11 11:03:20,247 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2019-01-11 11:03:20,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:20,636 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2019-01-11 11:03:20,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-11 11:03:20,637 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-01-11 11:03:20,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:20,637 INFO L225 Difference]: With dead ends: 184 [2019-01-11 11:03:20,637 INFO L226 Difference]: Without dead ends: 123 [2019-01-11 11:03:20,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-11 11:03:20,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-11 11:03:20,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-01-11 11:03:20,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-11 11:03:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-01-11 11:03:20,642 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-01-11 11:03:20,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:20,642 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-01-11 11:03:20,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-11 11:03:20,642 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-01-11 11:03:20,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-11 11:03:20,643 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:20,643 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2019-01-11 11:03:20,643 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:20,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:20,644 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2019-01-11 11:03:20,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:20,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:20,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:20,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:20,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:22,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-11 11:03:22,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:22,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:22,227 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:22,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:22,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:22,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:22,236 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:03:22,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:03:23,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-01-11 11:03:23,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:23,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:23,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-11 11:03:23,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:27,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-11 11:03:27,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:27,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-01-11 11:03:27,406 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:27,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-11 11:03:27,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-11 11:03:27,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-11 11:03:27,408 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2019-01-11 11:03:27,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:27,720 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2019-01-11 11:03:27,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-11 11:03:27,720 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2019-01-11 11:03:27,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:27,721 INFO L225 Difference]: With dead ends: 187 [2019-01-11 11:03:27,721 INFO L226 Difference]: Without dead ends: 125 [2019-01-11 11:03:27,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-11 11:03:27,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-11 11:03:27,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-01-11 11:03:27,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-11 11:03:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-01-11 11:03:27,725 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2019-01-11 11:03:27,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:27,725 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-01-11 11:03:27,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-11 11:03:27,725 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-01-11 11:03:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-01-11 11:03:27,726 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:27,726 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2019-01-11 11:03:27,726 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:27,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:27,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2019-01-11 11:03:27,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:27,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:27,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:27,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:27,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-11 11:03:29,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:29,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:29,098 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:29,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:29,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:29,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:29,107 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:03:29,107 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:03:29,192 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:03:29,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:29,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:29,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-11 11:03:29,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:33,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-11 11:03:33,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:33,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-01-11 11:03:33,314 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:33,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-11 11:03:33,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-11 11:03:33,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-11 11:03:33,315 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2019-01-11 11:03:33,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:33,598 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2019-01-11 11:03:33,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-11 11:03:33,599 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2019-01-11 11:03:33,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:33,600 INFO L225 Difference]: With dead ends: 190 [2019-01-11 11:03:33,600 INFO L226 Difference]: Without dead ends: 127 [2019-01-11 11:03:33,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-11 11:03:33,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-11 11:03:33,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-01-11 11:03:33,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-11 11:03:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-01-11 11:03:33,603 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2019-01-11 11:03:33,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:33,604 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-01-11 11:03:33,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-11 11:03:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-01-11 11:03:33,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-11 11:03:33,604 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:33,604 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2019-01-11 11:03:33,605 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:33,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:33,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2019-01-11 11:03:33,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:33,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:33,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:33,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:33,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:35,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-11 11:03:35,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:35,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:35,008 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:35,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:35,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:35,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:35,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:35,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:03:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:35,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:35,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-11 11:03:35,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:39,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-11 11:03:39,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:39,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-01-11 11:03:39,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:39,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-11 11:03:39,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-11 11:03:39,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-11 11:03:39,429 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2019-01-11 11:03:39,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:39,758 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2019-01-11 11:03:39,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-11 11:03:39,759 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2019-01-11 11:03:39,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:39,759 INFO L225 Difference]: With dead ends: 193 [2019-01-11 11:03:39,759 INFO L226 Difference]: Without dead ends: 129 [2019-01-11 11:03:39,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-11 11:03:39,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-11 11:03:39,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-01-11 11:03:39,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-11 11:03:39,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-01-11 11:03:39,763 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-01-11 11:03:39,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:39,763 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-01-11 11:03:39,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-11 11:03:39,763 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-01-11 11:03:39,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-11 11:03:39,763 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:39,763 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2019-01-11 11:03:39,764 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:39,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:39,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2019-01-11 11:03:39,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:39,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:39,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:39,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:39,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:41,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-11 11:03:41,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:41,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:41,521 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:41,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:41,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:41,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:41,530 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:03:41,530 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:03:42,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-11 11:03:42,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:42,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:42,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-11 11:03:42,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:46,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-11 11:03:46,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:46,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-01-11 11:03:46,798 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:46,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-11 11:03:46,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-11 11:03:46,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-11 11:03:46,800 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2019-01-11 11:03:47,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:47,159 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2019-01-11 11:03:47,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-11 11:03:47,160 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-01-11 11:03:47,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:47,160 INFO L225 Difference]: With dead ends: 196 [2019-01-11 11:03:47,160 INFO L226 Difference]: Without dead ends: 131 [2019-01-11 11:03:47,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-11 11:03:47,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-11 11:03:47,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-01-11 11:03:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-11 11:03:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-01-11 11:03:47,165 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2019-01-11 11:03:47,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:47,165 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-01-11 11:03:47,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-11 11:03:47,165 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-01-11 11:03:47,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-11 11:03:47,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:47,166 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2019-01-11 11:03:47,166 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:47,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:47,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2019-01-11 11:03:47,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:47,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:47,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:47,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:47,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:48,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-11 11:03:48,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:48,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:48,682 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:48,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:48,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:48,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:48,697 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:03:48,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:03:48,787 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:03:48,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:48,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-11 11:03:48,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:53,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-11 11:03:53,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:53,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-01-11 11:03:53,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:53,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-11 11:03:53,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-11 11:03:53,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-11 11:03:53,242 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2019-01-11 11:03:53,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:53,629 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2019-01-11 11:03:53,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-11 11:03:53,629 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2019-01-11 11:03:53,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:53,630 INFO L225 Difference]: With dead ends: 199 [2019-01-11 11:03:53,630 INFO L226 Difference]: Without dead ends: 133 [2019-01-11 11:03:53,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-11 11:03:53,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-11 11:03:53,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-01-11 11:03:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-11 11:03:53,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-01-11 11:03:53,633 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2019-01-11 11:03:53,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:53,633 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-01-11 11:03:53,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-11 11:03:53,634 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-01-11 11:03:53,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-11 11:03:53,634 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:53,634 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2019-01-11 11:03:53,635 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:53,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:53,635 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2019-01-11 11:03:53,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:53,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:53,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:53,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:53,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-11 11:03:55,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:55,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:55,154 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:55,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:55,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:55,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:55,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:55,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:03:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:55,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:55,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-11 11:03:55,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-11 11:04:00,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:00,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-01-11 11:04:00,235 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:00,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-11 11:04:00,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-11 11:04:00,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-11 11:04:00,236 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2019-01-11 11:04:00,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:00,647 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2019-01-11 11:04:00,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-11 11:04:00,648 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2019-01-11 11:04:00,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:00,648 INFO L225 Difference]: With dead ends: 202 [2019-01-11 11:04:00,649 INFO L226 Difference]: Without dead ends: 135 [2019-01-11 11:04:00,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-11 11:04:00,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-11 11:04:00,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-01-11 11:04:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-01-11 11:04:00,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-01-11 11:04:00,653 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-01-11 11:04:00,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:00,653 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-01-11 11:04:00,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-11 11:04:00,653 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-01-11 11:04:00,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-01-11 11:04:00,654 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:00,654 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2019-01-11 11:04:00,654 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:00,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:00,655 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2019-01-11 11:04:00,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:00,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:00,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:00,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:00,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-11 11:04:02,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:02,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:02,617 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:02,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:02,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:02,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:04:02,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:04:02,626 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:04:05,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-11 11:04:05,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:05,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:05,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-11 11:04:05,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:11,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-11 11:04:11,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:11,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-01-11 11:04:11,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:11,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-11 11:04:11,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-11 11:04:11,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-11 11:04:11,199 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2019-01-11 11:04:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:11,571 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2019-01-11 11:04:11,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-11 11:04:11,571 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2019-01-11 11:04:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:11,572 INFO L225 Difference]: With dead ends: 205 [2019-01-11 11:04:11,572 INFO L226 Difference]: Without dead ends: 137 [2019-01-11 11:04:11,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-11 11:04:11,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-11 11:04:11,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-01-11 11:04:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-11 11:04:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-01-11 11:04:11,575 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2019-01-11 11:04:11,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:11,576 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-01-11 11:04:11,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-11 11:04:11,576 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-01-11 11:04:11,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-11 11:04:11,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:11,576 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2019-01-11 11:04:11,577 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:11,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:11,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2019-01-11 11:04:11,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:11,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:11,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:11,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:11,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:13,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-11 11:04:13,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:13,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:13,342 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:13,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:13,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:13,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:04:13,353 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:04:13,353 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:04:13,443 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:04:13,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:13,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-11 11:04:13,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-11 11:04:18,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:18,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-01-11 11:04:18,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:18,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-11 11:04:18,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-11 11:04:18,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-11 11:04:18,326 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2019-01-11 11:04:18,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:18,788 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2019-01-11 11:04:18,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-11 11:04:18,789 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-01-11 11:04:18,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:18,789 INFO L225 Difference]: With dead ends: 208 [2019-01-11 11:04:18,789 INFO L226 Difference]: Without dead ends: 139 [2019-01-11 11:04:18,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-11 11:04:18,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-11 11:04:18,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-01-11 11:04:18,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-01-11 11:04:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-01-11 11:04:18,793 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2019-01-11 11:04:18,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:18,793 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-01-11 11:04:18,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-11 11:04:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-01-11 11:04:18,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-01-11 11:04:18,793 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:18,794 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2019-01-11 11:04:18,794 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:18,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:18,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2019-01-11 11:04:18,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:18,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:18,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:18,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:18,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:20,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-11 11:04:20,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:20,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:20,474 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:20,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:20,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:20,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:04:20,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:20,482 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:04:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:20,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-11 11:04:20,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-11 11:04:25,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:25,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-01-11 11:04:25,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:25,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-11 11:04:25,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-11 11:04:25,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-11 11:04:25,614 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2019-01-11 11:04:26,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:26,061 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2019-01-11 11:04:26,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-11 11:04:26,062 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2019-01-11 11:04:26,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:26,062 INFO L225 Difference]: With dead ends: 211 [2019-01-11 11:04:26,062 INFO L226 Difference]: Without dead ends: 141 [2019-01-11 11:04:26,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-11 11:04:26,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-11 11:04:26,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-01-11 11:04:26,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-11 11:04:26,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-01-11 11:04:26,065 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-01-11 11:04:26,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:26,066 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-01-11 11:04:26,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-11 11:04:26,066 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-01-11 11:04:26,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-11 11:04:26,066 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:26,066 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2019-01-11 11:04:26,067 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:26,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:26,067 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2019-01-11 11:04:26,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:26,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:26,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:26,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:26,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:28,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-11 11:04:28,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:28,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:28,006 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:28,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:28,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:28,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:04:28,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:04:28,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:04:31,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-11 11:04:31,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:31,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:31,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-11 11:04:31,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-11 11:04:36,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:36,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-01-11 11:04:36,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:36,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-11 11:04:36,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-11 11:04:36,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-11 11:04:36,544 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2019-01-11 11:04:37,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:37,005 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2019-01-11 11:04:37,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-11 11:04:37,005 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2019-01-11 11:04:37,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:37,006 INFO L225 Difference]: With dead ends: 214 [2019-01-11 11:04:37,006 INFO L226 Difference]: Without dead ends: 143 [2019-01-11 11:04:37,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-11 11:04:37,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-01-11 11:04:37,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-01-11 11:04:37,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-11 11:04:37,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-01-11 11:04:37,009 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2019-01-11 11:04:37,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:37,009 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-01-11 11:04:37,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-11 11:04:37,009 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-01-11 11:04:37,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-11 11:04:37,010 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:37,010 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2019-01-11 11:04:37,010 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:37,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:37,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2019-01-11 11:04:37,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:37,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:37,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:37,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:37,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:38,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-11 11:04:38,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:38,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:38,803 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:38,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:38,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:38,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:04:38,810 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:04:38,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:04:38,909 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:04:38,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:38,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:38,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-11 11:04:38,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-11 11:04:44,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:44,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-01-11 11:04:44,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:44,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-11 11:04:44,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-11 11:04:44,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-11 11:04:44,171 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2019-01-11 11:04:44,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:44,636 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2019-01-11 11:04:44,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-11 11:04:44,636 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2019-01-11 11:04:44,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:44,637 INFO L225 Difference]: With dead ends: 217 [2019-01-11 11:04:44,637 INFO L226 Difference]: Without dead ends: 145 [2019-01-11 11:04:44,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-11 11:04:44,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-11 11:04:44,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-01-11 11:04:44,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-11 11:04:44,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-01-11 11:04:44,641 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2019-01-11 11:04:44,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:44,641 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-01-11 11:04:44,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-11 11:04:44,641 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-01-11 11:04:44,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-01-11 11:04:44,642 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:44,642 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2019-01-11 11:04:44,642 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:44,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:44,642 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2019-01-11 11:04:44,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:44,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:44,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:44,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:44,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:46,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-11 11:04:46,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:46,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:46,454 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:46,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:46,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:46,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:04:46,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:46,462 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:04:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:46,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:46,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-11 11:04:46,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:51,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-11 11:04:51,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:51,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-01-11 11:04:51,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:51,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-11 11:04:51,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-11 11:04:51,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-11 11:04:51,942 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2019-01-11 11:04:52,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:52,317 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2019-01-11 11:04:52,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-11 11:04:52,317 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-01-11 11:04:52,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:52,318 INFO L225 Difference]: With dead ends: 220 [2019-01-11 11:04:52,318 INFO L226 Difference]: Without dead ends: 147 [2019-01-11 11:04:52,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-11 11:04:52,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-01-11 11:04:52,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-01-11 11:04:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-11 11:04:52,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-01-11 11:04:52,324 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-01-11 11:04:52,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:52,324 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-01-11 11:04:52,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-11 11:04:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-01-11 11:04:52,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-11 11:04:52,325 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:52,325 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2019-01-11 11:04:52,325 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:52,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:52,326 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2019-01-11 11:04:52,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:52,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:52,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:52,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:52,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:54,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-11 11:04:54,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:54,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:54,611 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:54,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:54,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:54,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:04:54,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:04:54,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:04:57,247 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-01-11 11:04:57,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:57,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:57,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-11 11:04:57,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:03,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-11 11:05:03,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:03,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-01-11 11:05:03,140 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:03,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-11 11:05:03,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-11 11:05:03,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-11 11:05:03,142 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2019-01-11 11:05:03,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:03,682 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2019-01-11 11:05:03,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-11 11:05:03,682 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2019-01-11 11:05:03,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:03,683 INFO L225 Difference]: With dead ends: 223 [2019-01-11 11:05:03,683 INFO L226 Difference]: Without dead ends: 149 [2019-01-11 11:05:03,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-11 11:05:03,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-11 11:05:03,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-01-11 11:05:03,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-11 11:05:03,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-01-11 11:05:03,687 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2019-01-11 11:05:03,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:03,687 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-01-11 11:05:03,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-11 11:05:03,687 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-01-11 11:05:03,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-01-11 11:05:03,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:03,688 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2019-01-11 11:05:03,688 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:05:03,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:03,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2019-01-11 11:05:03,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:03,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:03,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:05:03,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:03,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:05,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-11 11:05:05,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:05,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:05,979 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:05,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:05,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:05,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:05:05,987 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:05:05,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:05:06,087 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:05:06,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:05:06,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:06,135 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-11 11:05:06,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:11,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-11 11:05:11,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:11,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-01-11 11:05:11,725 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:11,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-11 11:05:11,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-11 11:05:11,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-11 11:05:11,727 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2019-01-11 11:05:12,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:12,218 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2019-01-11 11:05:12,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-11 11:05:12,218 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2019-01-11 11:05:12,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:12,219 INFO L225 Difference]: With dead ends: 226 [2019-01-11 11:05:12,219 INFO L226 Difference]: Without dead ends: 151 [2019-01-11 11:05:12,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-11 11:05:12,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-11 11:05:12,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-01-11 11:05:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-11 11:05:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-01-11 11:05:12,223 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2019-01-11 11:05:12,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:12,223 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-01-11 11:05:12,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-11 11:05:12,224 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-01-11 11:05:12,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-11 11:05:12,224 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:12,225 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2019-01-11 11:05:12,225 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:05:12,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:12,225 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2019-01-11 11:05:12,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:12,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:12,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:05:12,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:12,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:14,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-11 11:05:14,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:14,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:14,538 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:14,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:14,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:14,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:05:14,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:14,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:05:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:14,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:14,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-11 11:05:14,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-11 11:05:20,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:20,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-01-11 11:05:20,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:20,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-11 11:05:20,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-11 11:05:20,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-11 11:05:20,328 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2019-01-11 11:05:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:20,791 INFO L93 Difference]: Finished difference Result 229 states and 232 transitions. [2019-01-11 11:05:20,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-11 11:05:20,791 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2019-01-11 11:05:20,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:20,792 INFO L225 Difference]: With dead ends: 229 [2019-01-11 11:05:20,792 INFO L226 Difference]: Without dead ends: 153 [2019-01-11 11:05:20,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-11 11:05:20,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-11 11:05:20,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-01-11 11:05:20,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-11 11:05:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-01-11 11:05:20,796 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-01-11 11:05:20,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:20,797 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-01-11 11:05:20,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-11 11:05:20,797 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-01-11 11:05:20,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-01-11 11:05:20,798 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:20,798 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2019-01-11 11:05:20,798 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:05:20,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:20,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2019-01-11 11:05:20,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:20,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:20,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:20,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:20,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-11 11:05:22,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:22,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:22,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:22,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:22,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:22,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:05:22,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:05:22,804 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:05:24,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-11 11:05:24,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:05:24,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:25,002 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-11 11:05:25,003 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:30,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-11 11:05:30,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:30,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-01-11 11:05:30,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:30,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-11 11:05:30,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-11 11:05:30,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-11 11:05:30,861 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2019-01-11 11:05:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:31,381 INFO L93 Difference]: Finished difference Result 232 states and 235 transitions. [2019-01-11 11:05:31,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-11 11:05:31,381 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2019-01-11 11:05:31,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:31,382 INFO L225 Difference]: With dead ends: 232 [2019-01-11 11:05:31,382 INFO L226 Difference]: Without dead ends: 155 [2019-01-11 11:05:31,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-11 11:05:31,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-11 11:05:31,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-01-11 11:05:31,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-01-11 11:05:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-01-11 11:05:31,386 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2019-01-11 11:05:31,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:31,386 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-01-11 11:05:31,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-11 11:05:31,386 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-01-11 11:05:31,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-01-11 11:05:31,387 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:31,387 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2019-01-11 11:05:31,387 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:05:31,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:31,388 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2019-01-11 11:05:31,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:31,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:31,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:05:31,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:31,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:33,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-11 11:05:33,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:33,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:33,848 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:33,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:33,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:33,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:05:33,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:05:33,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:05:33,962 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:05:33,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:05:33,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:33,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-11 11:05:33,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:40,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-11 11:05:40,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:40,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-01-11 11:05:40,064 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:40,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-11 11:05:40,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-11 11:05:40,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-11 11:05:40,066 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2019-01-11 11:05:40,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:40,695 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2019-01-11 11:05:40,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-11 11:05:40,696 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2019-01-11 11:05:40,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:40,696 INFO L225 Difference]: With dead ends: 235 [2019-01-11 11:05:40,696 INFO L226 Difference]: Without dead ends: 157 [2019-01-11 11:05:40,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-11 11:05:40,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-01-11 11:05:40,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-01-11 11:05:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-11 11:05:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-01-11 11:05:40,700 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2019-01-11 11:05:40,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:40,700 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-01-11 11:05:40,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-11 11:05:40,700 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-01-11 11:05:40,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-11 11:05:40,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:40,701 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2019-01-11 11:05:40,701 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:05:40,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:40,701 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2019-01-11 11:05:40,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:40,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:40,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:05:40,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:40,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:42,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-11 11:05:42,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:42,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:42,797 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:42,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:42,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:42,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:05:42,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:42,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:05:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:42,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:42,933 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-11 11:05:42,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:49,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-11 11:05:49,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:49,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-01-11 11:05:49,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:49,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-11 11:05:49,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-11 11:05:49,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-11 11:05:49,520 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2019-01-11 11:05:50,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:50,052 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2019-01-11 11:05:50,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-11 11:05:50,052 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2019-01-11 11:05:50,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:50,053 INFO L225 Difference]: With dead ends: 238 [2019-01-11 11:05:50,053 INFO L226 Difference]: Without dead ends: 159 [2019-01-11 11:05:50,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-11 11:05:50,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-11 11:05:50,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-01-11 11:05:50,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-01-11 11:05:50,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-01-11 11:05:50,057 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-01-11 11:05:50,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:50,057 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-01-11 11:05:50,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-11 11:05:50,057 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-01-11 11:05:50,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-11 11:05:50,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:50,058 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2019-01-11 11:05:50,058 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:05:50,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:50,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2019-01-11 11:05:50,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:50,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:50,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:50,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:50,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-11 11:05:52,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:52,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:52,238 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:52,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:52,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:52,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:05:52,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:05:52,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:05:56,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-11 11:05:56,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:05:56,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:56,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-11 11:05:56,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-11 11:06:03,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:03,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-01-11 11:06:03,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:03,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-11 11:06:03,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-11 11:06:03,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-11 11:06:03,181 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2019-01-11 11:06:03,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:03,824 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2019-01-11 11:06:03,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-11 11:06:03,825 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2019-01-11 11:06:03,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:03,825 INFO L225 Difference]: With dead ends: 241 [2019-01-11 11:06:03,826 INFO L226 Difference]: Without dead ends: 161 [2019-01-11 11:06:03,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-11 11:06:03,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-01-11 11:06:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-01-11 11:06:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-11 11:06:03,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-01-11 11:06:03,830 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2019-01-11 11:06:03,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:03,830 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-01-11 11:06:03,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-11 11:06:03,831 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-01-11 11:06:03,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-11 11:06:03,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:03,832 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2019-01-11 11:06:03,832 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:06:03,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:03,832 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2019-01-11 11:06:03,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:03,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:03,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:06:03,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:03,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:06,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-11 11:06:06,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:06,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:06,349 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:06,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:06,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:06,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:06:06,357 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:06:06,358 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:06:06,467 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:06:06,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:06:06,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:06,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-11 11:06:06,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:12,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-11 11:06:12,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:12,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-01-11 11:06:12,943 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:12,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-11 11:06:12,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-11 11:06:12,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-11 11:06:12,946 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2019-01-11 11:06:13,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:13,667 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2019-01-11 11:06:13,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-11 11:06:13,667 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2019-01-11 11:06:13,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:13,668 INFO L225 Difference]: With dead ends: 244 [2019-01-11 11:06:13,668 INFO L226 Difference]: Without dead ends: 163 [2019-01-11 11:06:13,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-11 11:06:13,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-11 11:06:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-01-11 11:06:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-01-11 11:06:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-01-11 11:06:13,673 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2019-01-11 11:06:13,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:13,673 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-01-11 11:06:13,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-11 11:06:13,673 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-01-11 11:06:13,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-01-11 11:06:13,674 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:13,674 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2019-01-11 11:06:13,674 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:06:13,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:13,675 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2019-01-11 11:06:13,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:13,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:13,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:06:13,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:13,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-11 11:06:16,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:16,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:16,176 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:16,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:16,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:16,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:06:16,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:06:16,184 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:06:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:16,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:16,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-11 11:06:16,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:23,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-11 11:06:23,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:23,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-01-11 11:06:23,094 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:23,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-11 11:06:23,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-11 11:06:23,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-11 11:06:23,096 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2019-01-11 11:06:23,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:23,843 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2019-01-11 11:06:23,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-11 11:06:23,843 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2019-01-11 11:06:23,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:23,844 INFO L225 Difference]: With dead ends: 247 [2019-01-11 11:06:23,844 INFO L226 Difference]: Without dead ends: 165 [2019-01-11 11:06:23,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-11 11:06:23,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-01-11 11:06:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-01-11 11:06:23,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-11 11:06:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-01-11 11:06:23,847 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-01-11 11:06:23,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:23,848 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-01-11 11:06:23,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-11 11:06:23,848 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-01-11 11:06:23,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-01-11 11:06:23,849 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:23,849 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2019-01-11 11:06:23,849 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:06:23,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:23,849 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2019-01-11 11:06:23,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:23,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:23,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:06:23,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:23,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-11 11:06:26,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:26,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:26,516 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:26,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:26,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:26,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:06:26,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:06:26,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:06:29,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-11 11:06:29,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:06:29,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:29,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-11 11:06:29,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:36,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-11 11:06:36,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:36,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-01-11 11:06:36,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:36,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-11 11:06:36,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-11 11:06:36,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-11 11:06:36,643 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2019-01-11 11:06:37,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:37,341 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2019-01-11 11:06:37,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-11 11:06:37,341 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2019-01-11 11:06:37,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:37,342 INFO L225 Difference]: With dead ends: 250 [2019-01-11 11:06:37,342 INFO L226 Difference]: Without dead ends: 167 [2019-01-11 11:06:37,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-11 11:06:37,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-01-11 11:06:37,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-01-11 11:06:37,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-11 11:06:37,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-01-11 11:06:37,345 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2019-01-11 11:06:37,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:37,346 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-01-11 11:06:37,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-11 11:06:37,346 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-01-11 11:06:37,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-01-11 11:06:37,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:37,346 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2019-01-11 11:06:37,347 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:06:37,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:37,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2019-01-11 11:06:37,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:37,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:37,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:06:37,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:37,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-11 11:06:39,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:39,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:39,811 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:39,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:39,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:39,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:06:39,819 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:06:39,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:06:39,930 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:06:39,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:06:39,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-11 11:06:39,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:47,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-11 11:06:47,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:47,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-01-11 11:06:47,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:47,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-11 11:06:47,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-11 11:06:47,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-11 11:06:47,203 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2019-01-11 11:06:47,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:47,789 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2019-01-11 11:06:47,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-11 11:06:47,790 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2019-01-11 11:06:47,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:47,790 INFO L225 Difference]: With dead ends: 253 [2019-01-11 11:06:47,791 INFO L226 Difference]: Without dead ends: 169 [2019-01-11 11:06:47,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-11 11:06:47,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-01-11 11:06:47,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-01-11 11:06:47,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-11 11:06:47,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-01-11 11:06:47,794 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2019-01-11 11:06:47,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:47,794 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-01-11 11:06:47,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-11 11:06:47,794 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-01-11 11:06:47,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-01-11 11:06:47,795 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:47,795 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2019-01-11 11:06:47,795 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:06:47,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:47,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2019-01-11 11:06:47,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:47,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:47,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:06:47,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:47,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-11 11:06:50,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:50,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:50,471 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:50,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:50,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:50,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:06:50,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:06:50,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:06:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:50,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:50,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-11 11:06:50,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-11 11:06:57,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:57,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-01-11 11:06:57,961 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:57,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-11 11:06:57,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-11 11:06:57,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-11 11:06:57,963 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2019-01-11 11:06:58,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:58,738 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2019-01-11 11:06:58,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-11 11:06:58,738 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2019-01-11 11:06:58,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:58,739 INFO L225 Difference]: With dead ends: 256 [2019-01-11 11:06:58,739 INFO L226 Difference]: Without dead ends: 171 [2019-01-11 11:06:58,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-11 11:06:58,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-11 11:06:58,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-01-11 11:06:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-11 11:06:58,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2019-01-11 11:06:58,743 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2019-01-11 11:06:58,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:58,743 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2019-01-11 11:06:58,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-11 11:06:58,743 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2019-01-11 11:06:58,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-11 11:06:58,744 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:58,744 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2019-01-11 11:06:58,744 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:06:58,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:58,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2019-01-11 11:06:58,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:58,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:58,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:06:58,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:58,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:01,535 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-11 11:07:01,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:01,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:01,536 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:01,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:07:01,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:01,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:07:01,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:07:01,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:07:10,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-11 11:07:10,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:07:10,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:10,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-11 11:07:10,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:07:17,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-11 11:07:17,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:07:17,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-01-11 11:07:17,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:07:17,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-11 11:07:17,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-11 11:07:17,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-11 11:07:17,893 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2019-01-11 11:07:18,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:07:18,742 INFO L93 Difference]: Finished difference Result 259 states and 262 transitions. [2019-01-11 11:07:18,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-11 11:07:18,743 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2019-01-11 11:07:18,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:07:18,744 INFO L225 Difference]: With dead ends: 259 [2019-01-11 11:07:18,744 INFO L226 Difference]: Without dead ends: 173 [2019-01-11 11:07:18,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-11 11:07:18,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-11 11:07:18,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-01-11 11:07:18,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-11 11:07:18,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2019-01-11 11:07:18,748 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2019-01-11 11:07:18,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:07:18,748 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2019-01-11 11:07:18,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-11 11:07:18,748 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2019-01-11 11:07:18,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-01-11 11:07:18,749 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:07:18,749 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2019-01-11 11:07:18,749 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:07:18,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:07:18,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2019-01-11 11:07:18,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:07:18,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:18,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:07:18,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:18,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:07:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-11 11:07:21,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:21,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:21,530 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:21,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:07:21,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:21,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:07:21,538 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:07:21,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:07:21,650 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:07:21,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:07:21,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-11 11:07:21,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:07:29,426 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-11 11:07:29,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:07:29,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-01-11 11:07:29,461 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:07:29,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-11 11:07:29,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-11 11:07:29,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-11 11:07:29,463 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2019-01-11 11:07:30,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:07:30,354 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2019-01-11 11:07:30,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-11 11:07:30,355 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2019-01-11 11:07:30,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:07:30,355 INFO L225 Difference]: With dead ends: 262 [2019-01-11 11:07:30,355 INFO L226 Difference]: Without dead ends: 175 [2019-01-11 11:07:30,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-11 11:07:30,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-11 11:07:30,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-01-11 11:07:30,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-11 11:07:30,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-01-11 11:07:30,360 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2019-01-11 11:07:30,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:07:30,360 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-01-11 11:07:30,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-11 11:07:30,360 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-01-11 11:07:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-11 11:07:30,361 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:07:30,361 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2019-01-11 11:07:30,362 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:07:30,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:07:30,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2019-01-11 11:07:30,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:07:30,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:30,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:07:30,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:30,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:07:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:33,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-11 11:07:33,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:33,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:33,335 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:33,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:07:33,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:33,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:07:33,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:07:33,345 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:07:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:33,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-11 11:07:33,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:07:41,175 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-11 11:07:41,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:07:41,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-01-11 11:07:41,194 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:07:41,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-11 11:07:41,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-11 11:07:41,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-11 11:07:41,197 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2019-01-11 11:07:42,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:07:42,027 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2019-01-11 11:07:42,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-11 11:07:42,028 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2019-01-11 11:07:42,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:07:42,029 INFO L225 Difference]: With dead ends: 265 [2019-01-11 11:07:42,029 INFO L226 Difference]: Without dead ends: 177 [2019-01-11 11:07:42,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-11 11:07:42,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-11 11:07:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-01-11 11:07:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-11 11:07:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-01-11 11:07:42,034 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2019-01-11 11:07:42,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:07:42,035 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-01-11 11:07:42,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-11 11:07:42,035 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-01-11 11:07:42,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-01-11 11:07:42,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:07:42,037 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2019-01-11 11:07:42,045 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:07:42,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:07:42,045 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2019-01-11 11:07:42,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:07:42,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:42,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:07:42,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:42,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:07:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-11 11:07:44,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:44,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:44,765 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:44,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:07:44,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:44,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:07:44,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:07:44,773 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:07:53,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-11 11:07:53,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:07:53,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-11 11:07:53,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:08:01,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-11 11:08:01,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:08:01,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-01-11 11:08:01,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:08:01,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-11 11:08:01,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-11 11:08:01,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-11 11:08:01,793 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2019-01-11 11:08:02,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:02,656 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2019-01-11 11:08:02,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-11 11:08:02,657 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2019-01-11 11:08:02,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:02,658 INFO L225 Difference]: With dead ends: 268 [2019-01-11 11:08:02,658 INFO L226 Difference]: Without dead ends: 179 [2019-01-11 11:08:02,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-11 11:08:02,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-01-11 11:08:02,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-01-11 11:08:02,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-11 11:08:02,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-01-11 11:08:02,663 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2019-01-11 11:08:02,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:02,663 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-01-11 11:08:02,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-11 11:08:02,663 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-01-11 11:08:02,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-01-11 11:08:02,664 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:02,664 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2019-01-11 11:08:02,664 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:08:02,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:02,665 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2019-01-11 11:08:02,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:02,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:02,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:08:02,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:02,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-11 11:08:05,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:05,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:05,359 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:05,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:08:05,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:05,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:08:05,369 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:08:05,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:08:05,490 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:08:05,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:08:05,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:08:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-11 11:08:05,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:08:13,782 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-11 11:08:13,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:08:13,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-01-11 11:08:13,800 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:08:13,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-11 11:08:13,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-11 11:08:13,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-11 11:08:13,802 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2019-01-11 11:08:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:14,720 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2019-01-11 11:08:14,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-11 11:08:14,720 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2019-01-11 11:08:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:14,721 INFO L225 Difference]: With dead ends: 271 [2019-01-11 11:08:14,721 INFO L226 Difference]: Without dead ends: 181 [2019-01-11 11:08:14,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-11 11:08:14,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-01-11 11:08:14,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-01-11 11:08:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-11 11:08:14,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2019-01-11 11:08:14,725 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2019-01-11 11:08:14,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:14,725 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2019-01-11 11:08:14,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-11 11:08:14,726 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2019-01-11 11:08:14,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-11 11:08:14,726 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:14,726 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2019-01-11 11:08:14,726 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:08:14,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:14,727 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2019-01-11 11:08:14,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:14,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:14,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:08:14,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:14,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:17,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-11 11:08:17,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:17,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:17,830 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:17,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:08:17,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:17,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:08:17,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:08:17,839 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:08:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:17,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:08:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-11 11:08:17,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:08:26,136 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-11 11:08:26,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:08:26,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-01-11 11:08:26,154 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:08:26,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-11 11:08:26,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-11 11:08:26,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-11 11:08:26,157 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2019-01-11 11:08:26,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:26,914 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-01-11 11:08:26,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-11 11:08:26,914 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2019-01-11 11:08:26,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:26,915 INFO L225 Difference]: With dead ends: 274 [2019-01-11 11:08:26,915 INFO L226 Difference]: Without dead ends: 183 [2019-01-11 11:08:26,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-11 11:08:26,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-01-11 11:08:26,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-01-11 11:08:26,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-01-11 11:08:26,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-01-11 11:08:26,919 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2019-01-11 11:08:26,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:26,919 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-01-11 11:08:26,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-11 11:08:26,919 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-01-11 11:08:26,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-01-11 11:08:26,920 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:26,920 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2019-01-11 11:08:26,920 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:08:26,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:26,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2019-01-11 11:08:26,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:26,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:26,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:08:26,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:26,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-01-11 11:08:30,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:30,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:30,173 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:30,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:08:30,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:30,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:08:30,182 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:08:30,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:08:34,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-11 11:08:34,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:08:34,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:08:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-01-11 11:08:34,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:08:43,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-01-11 11:08:43,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:08:43,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-01-11 11:08:43,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:08:43,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-11 11:08:43,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-11 11:08:43,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-11 11:08:43,259 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2019-01-11 11:08:44,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:44,024 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2019-01-11 11:08:44,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-11 11:08:44,025 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2019-01-11 11:08:44,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:44,026 INFO L225 Difference]: With dead ends: 277 [2019-01-11 11:08:44,026 INFO L226 Difference]: Without dead ends: 185 [2019-01-11 11:08:44,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-11 11:08:44,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-11 11:08:44,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-01-11 11:08:44,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-11 11:08:44,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-01-11 11:08:44,030 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2019-01-11 11:08:44,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:44,030 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-01-11 11:08:44,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-11 11:08:44,030 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-01-11 11:08:44,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-11 11:08:44,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:44,031 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2019-01-11 11:08:44,032 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:08:44,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:44,032 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2019-01-11 11:08:44,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:44,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:44,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:08:44,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:44,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:46,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-11 11:08:46,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:46,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:46,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:46,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:08:46,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:46,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:08:46,987 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:08:46,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:08:47,109 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:08:47,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:08:47,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:08:47,139 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-11 11:08:47,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:08:55,933 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-11 11:08:55,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:08:55,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-01-11 11:08:55,952 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:08:55,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-11 11:08:55,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-11 11:08:55,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-11 11:08:55,954 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2019-01-11 11:08:56,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:56,759 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2019-01-11 11:08:56,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-11 11:08:56,760 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2019-01-11 11:08:56,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:56,760 INFO L225 Difference]: With dead ends: 280 [2019-01-11 11:08:56,760 INFO L226 Difference]: Without dead ends: 187 [2019-01-11 11:08:56,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-11 11:08:56,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-11 11:08:56,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-01-11 11:08:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-11 11:08:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-01-11 11:08:56,766 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2019-01-11 11:08:56,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:56,766 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2019-01-11 11:08:56,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-11 11:08:56,766 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2019-01-11 11:08:56,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-11 11:08:56,767 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:56,767 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2019-01-11 11:08:56,768 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:08:56,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:56,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2019-01-11 11:08:56,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:56,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:56,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:08:56,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:56,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-01-11 11:09:00,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:00,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:09:00,036 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:09:00,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:09:00,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:00,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:09:00,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:09:00,048 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:09:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:00,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:09:00,203 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-01-11 11:09:00,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:09:09,146 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-01-11 11:09:09,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:09:09,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-01-11 11:09:09,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:09:09,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-11 11:09:09,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-11 11:09:09,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-11 11:09:09,167 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2019-01-11 11:09:10,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:09:10,223 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2019-01-11 11:09:10,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-11 11:09:10,223 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2019-01-11 11:09:10,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:09:10,224 INFO L225 Difference]: With dead ends: 283 [2019-01-11 11:09:10,224 INFO L226 Difference]: Without dead ends: 189 [2019-01-11 11:09:10,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-11 11:09:10,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-11 11:09:10,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-01-11 11:09:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-11 11:09:10,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2019-01-11 11:09:10,229 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2019-01-11 11:09:10,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:09:10,229 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2019-01-11 11:09:10,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-11 11:09:10,229 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2019-01-11 11:09:10,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-01-11 11:09:10,230 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:09:10,230 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2019-01-11 11:09:10,230 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:09:10,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:09:10,231 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2019-01-11 11:09:10,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:09:10,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:10,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:09:10,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:10,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:09:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-01-11 11:09:13,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:13,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:09:13,305 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:09:13,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:09:13,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:13,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:09:13,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:09:13,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:09:18,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-01-11 11:09:18,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:09:18,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:09:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-01-11 11:09:18,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:09:27,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-01-11 11:09:27,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:09:27,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-01-11 11:09:27,557 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:09:27,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-11 11:09:27,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-11 11:09:27,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-11 11:09:27,559 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2019-01-11 11:09:28,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:09:28,489 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-01-11 11:09:28,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-11 11:09:28,489 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2019-01-11 11:09:28,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:09:28,490 INFO L225 Difference]: With dead ends: 286 [2019-01-11 11:09:28,490 INFO L226 Difference]: Without dead ends: 191 [2019-01-11 11:09:28,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-11 11:09:28,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-01-11 11:09:28,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-01-11 11:09:28,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-11 11:09:28,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-01-11 11:09:28,495 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2019-01-11 11:09:28,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:09:28,495 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-01-11 11:09:28,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-11 11:09:28,495 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-01-11 11:09:28,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-01-11 11:09:28,496 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:09:28,496 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2019-01-11 11:09:28,497 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:09:28,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:09:28,497 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2019-01-11 11:09:28,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:09:28,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:28,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:09:28,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:28,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:09:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:31,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-01-11 11:09:31,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:31,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:09:31,965 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:09:31,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:09:31,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:31,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:09:31,973 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:09:31,973 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:09:32,100 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:09:32,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:09:32,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:09:32,132 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-01-11 11:09:32,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:09:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-01-11 11:09:41,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:09:41,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-01-11 11:09:41,346 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:09:41,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-11 11:09:41,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-11 11:09:41,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-11 11:09:41,348 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2019-01-11 11:09:42,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:09:42,458 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2019-01-11 11:09:42,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-11 11:09:42,459 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2019-01-11 11:09:42,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:09:42,459 INFO L225 Difference]: With dead ends: 289 [2019-01-11 11:09:42,459 INFO L226 Difference]: Without dead ends: 193 [2019-01-11 11:09:42,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-11 11:09:42,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-01-11 11:09:42,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-01-11 11:09:42,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-11 11:09:42,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-01-11 11:09:42,464 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2019-01-11 11:09:42,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:09:42,464 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-01-11 11:09:42,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-11 11:09:42,464 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-01-11 11:09:42,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-11 11:09:42,465 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:09:42,465 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2019-01-11 11:09:42,465 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:09:42,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:09:42,465 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2019-01-11 11:09:42,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:09:42,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:42,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:09:42,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:42,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:09:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:45,963 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-01-11 11:09:45,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:45,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:09:45,963 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:09:45,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:09:45,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:45,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:09:45,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:09:45,972 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:09:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:46,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:09:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-01-11 11:09:46,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:09:55,519 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-01-11 11:09:55,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:09:55,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-01-11 11:09:55,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:09:55,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-11 11:09:55,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-11 11:09:55,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-11 11:09:55,541 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2019-01-11 11:09:56,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:09:56,713 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2019-01-11 11:09:56,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-11 11:09:56,714 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2019-01-11 11:09:56,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:09:56,715 INFO L225 Difference]: With dead ends: 292 [2019-01-11 11:09:56,715 INFO L226 Difference]: Without dead ends: 195 [2019-01-11 11:09:56,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-11 11:09:56,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-11 11:09:56,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-01-11 11:09:56,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-01-11 11:09:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2019-01-11 11:09:56,718 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2019-01-11 11:09:56,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:09:56,719 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2019-01-11 11:09:56,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-11 11:09:56,719 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2019-01-11 11:09:56,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-01-11 11:09:56,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:09:56,719 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2019-01-11 11:09:56,720 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:09:56,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:09:56,720 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2019-01-11 11:09:56,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:09:56,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:56,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:09:56,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:56,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:09:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-01-11 11:10:00,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:00,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:00,273 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:10:00,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:10:00,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:00,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:00,282 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:10:00,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:10:06,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-01-11 11:10:06,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:10:06,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-01-11 11:10:06,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:15,803 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-01-11 11:10:15,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:15,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-01-11 11:10:15,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:15,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-11 11:10:15,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-11 11:10:15,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-11 11:10:15,832 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2019-01-11 11:10:17,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:17,193 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-01-11 11:10:17,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-11 11:10:17,193 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2019-01-11 11:10:17,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:17,194 INFO L225 Difference]: With dead ends: 295 [2019-01-11 11:10:17,194 INFO L226 Difference]: Without dead ends: 197 [2019-01-11 11:10:17,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-11 11:10:17,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-11 11:10:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-01-11 11:10:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-11 11:10:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2019-01-11 11:10:17,199 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2019-01-11 11:10:17,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:17,199 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2019-01-11 11:10:17,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-11 11:10:17,199 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2019-01-11 11:10:17,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-01-11 11:10:17,200 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:17,200 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2019-01-11 11:10:17,201 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:17,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:17,201 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2019-01-11 11:10:17,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:17,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:17,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:10:17,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:17,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:20,875 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-01-11 11:10:20,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:20,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:20,876 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:10:20,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:10:20,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:20,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:20,883 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:10:20,884 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:10:21,016 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:10:21,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:10:21,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:21,047 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-01-11 11:10:21,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:31,101 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-01-11 11:10:31,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:31,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-01-11 11:10:31,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:31,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-11 11:10:31,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-11 11:10:31,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-11 11:10:31,122 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2019-01-11 11:10:32,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:32,492 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2019-01-11 11:10:32,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-11 11:10:32,492 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2019-01-11 11:10:32,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:32,493 INFO L225 Difference]: With dead ends: 298 [2019-01-11 11:10:32,493 INFO L226 Difference]: Without dead ends: 199 [2019-01-11 11:10:32,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-11 11:10:32,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-11 11:10:32,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-01-11 11:10:32,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-11 11:10:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-01-11 11:10:32,497 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2019-01-11 11:10:32,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:32,497 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-01-11 11:10:32,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-11 11:10:32,498 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-01-11 11:10:32,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-11 11:10:32,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:32,498 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2019-01-11 11:10:32,499 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:32,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:32,499 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2019-01-11 11:10:32,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:32,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:32,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:10:32,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:32,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-01-11 11:10:36,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:36,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:36,145 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:10:36,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:10:36,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:36,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:36,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:36,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:10:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:36,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:36,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-01-11 11:10:36,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-01-11 11:10:46,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:46,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-01-11 11:10:46,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:46,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-11 11:10:46,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-11 11:10:46,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-11 11:10:46,481 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2019-01-11 11:10:47,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:47,573 INFO L93 Difference]: Finished difference Result 301 states and 304 transitions. [2019-01-11 11:10:47,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-11 11:10:47,573 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2019-01-11 11:10:47,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:47,574 INFO L225 Difference]: With dead ends: 301 [2019-01-11 11:10:47,574 INFO L226 Difference]: Without dead ends: 201 [2019-01-11 11:10:47,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-11 11:10:47,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-11 11:10:47,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-01-11 11:10:47,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-11 11:10:47,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-01-11 11:10:47,578 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2019-01-11 11:10:47,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:47,578 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-01-11 11:10:47,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-11 11:10:47,579 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-01-11 11:10:47,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-11 11:10:47,580 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:47,580 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2019-01-11 11:10:47,580 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:47,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:47,580 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2019-01-11 11:10:47,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:47,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:47,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:47,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:47,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:51,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-01-11 11:10:51,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:51,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:51,180 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:10:51,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:10:51,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:51,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:51,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:10:51,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:11:05,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-01-11 11:11:05,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:11:05,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:05,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-01-11 11:11:05,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:15,912 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-01-11 11:11:15,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:15,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-01-11 11:11:15,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:15,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-11 11:11:15,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-11 11:11:15,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-11 11:11:15,943 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2019-01-11 11:11:17,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:17,293 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2019-01-11 11:11:17,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-11 11:11:17,294 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2019-01-11 11:11:17,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:17,294 INFO L225 Difference]: With dead ends: 304 [2019-01-11 11:11:17,294 INFO L226 Difference]: Without dead ends: 203 [2019-01-11 11:11:17,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-11 11:11:17,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-11 11:11:17,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-01-11 11:11:17,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-11 11:11:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2019-01-11 11:11:17,299 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2019-01-11 11:11:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:17,299 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2019-01-11 11:11:17,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-11 11:11:17,299 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2019-01-11 11:11:17,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-01-11 11:11:17,299 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:17,300 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2019-01-11 11:11:17,300 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:17,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:17,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2019-01-11 11:11:17,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:17,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:17,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:11:17,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:17,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:20,744 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-01-11 11:11:20,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:20,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:20,744 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:20,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:20,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:20,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:11:20,753 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:11:20,753 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:11:20,890 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:11:20,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:11:20,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:20,924 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-01-11 11:11:20,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-01-11 11:11:31,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:31,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-01-11 11:11:31,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:31,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-11 11:11:31,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-11 11:11:31,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-11 11:11:31,535 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2019-01-11 11:11:32,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:32,922 INFO L93 Difference]: Finished difference Result 307 states and 310 transitions. [2019-01-11 11:11:32,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-11 11:11:32,923 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2019-01-11 11:11:32,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:32,924 INFO L225 Difference]: With dead ends: 307 [2019-01-11 11:11:32,924 INFO L226 Difference]: Without dead ends: 205 [2019-01-11 11:11:32,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-11 11:11:32,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-01-11 11:11:32,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-01-11 11:11:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-01-11 11:11:32,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-01-11 11:11:32,928 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2019-01-11 11:11:32,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:32,928 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-01-11 11:11:32,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-11 11:11:32,928 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-01-11 11:11:32,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-01-11 11:11:32,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:32,929 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2019-01-11 11:11:32,929 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:32,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:32,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2019-01-11 11:11:32,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:32,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:32,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:11:32,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:32,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-01-11 11:11:36,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:36,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:36,460 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:36,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:36,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:36,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:11:36,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:36,474 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:36,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:36,643 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-01-11 11:11:36,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-01-11 11:11:47,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:47,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-01-11 11:11:47,759 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:47,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-11 11:11:47,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-11 11:11:47,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-11 11:11:47,762 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2019-01-11 11:11:49,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:49,157 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2019-01-11 11:11:49,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-11 11:11:49,157 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2019-01-11 11:11:49,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:49,158 INFO L225 Difference]: With dead ends: 310 [2019-01-11 11:11:49,158 INFO L226 Difference]: Without dead ends: 207 [2019-01-11 11:11:49,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-11 11:11:49,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-11 11:11:49,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-01-11 11:11:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-01-11 11:11:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-01-11 11:11:49,164 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2019-01-11 11:11:49,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:49,165 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-01-11 11:11:49,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-11 11:11:49,165 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-01-11 11:11:49,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-01-11 11:11:49,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:49,166 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2019-01-11 11:11:49,166 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:49,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:49,166 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2019-01-11 11:11:49,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:49,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:49,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:49,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:49,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-01-11 11:11:52,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:52,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:52,994 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:52,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:52,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:52,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:11:53,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:11:53,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:12:11,418 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-11 11:12:11,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:12:11,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:12:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-01-11 11:12:11,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:12:22,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-01-11 11:12:22,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:12:22,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-01-11 11:12:22,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:12:22,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-11 11:12:22,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-11 11:12:22,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-11 11:12:22,438 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2019-01-11 11:12:23,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:12:23,974 INFO L93 Difference]: Finished difference Result 313 states and 316 transitions. [2019-01-11 11:12:23,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-11 11:12:23,975 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2019-01-11 11:12:23,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:12:23,976 INFO L225 Difference]: With dead ends: 313 [2019-01-11 11:12:23,976 INFO L226 Difference]: Without dead ends: 209 [2019-01-11 11:12:23,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-11 11:12:23,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-11 11:12:23,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-01-11 11:12:23,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-01-11 11:12:23,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-01-11 11:12:23,982 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2019-01-11 11:12:23,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:12:23,982 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-01-11 11:12:23,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-11 11:12:23,983 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-01-11 11:12:23,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-01-11 11:12:23,984 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:12:23,984 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1] [2019-01-11 11:12:23,984 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:12:23,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:23,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1650876630, now seen corresponding path program 102 times [2019-01-11 11:12:23,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:12:23,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:23,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:12:23,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:23,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:12:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:27,780 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-01-11 11:12:27,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:27,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:12:27,781 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:12:27,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:12:27,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:27,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:12:27,790 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:12:27,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:12:27,930 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:12:27,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:12:27,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:12:27,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-01-11 11:12:27,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:12:39,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-01-11 11:12:39,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:12:39,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-01-11 11:12:39,513 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:12:39,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-11 11:12:39,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-11 11:12:39,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-11 11:12:39,516 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2019-01-11 11:12:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:12:40,847 INFO L93 Difference]: Finished difference Result 316 states and 319 transitions. [2019-01-11 11:12:40,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-11 11:12:40,847 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2019-01-11 11:12:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:12:40,848 INFO L225 Difference]: With dead ends: 316 [2019-01-11 11:12:40,848 INFO L226 Difference]: Without dead ends: 211 [2019-01-11 11:12:40,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-11 11:12:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-01-11 11:12:40,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-01-11 11:12:40,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-01-11 11:12:40,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2019-01-11 11:12:40,854 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2019-01-11 11:12:40,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:12:40,854 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2019-01-11 11:12:40,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-11 11:12:40,855 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2019-01-11 11:12:40,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-01-11 11:12:40,855 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:12:40,856 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1] [2019-01-11 11:12:40,856 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:12:40,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:40,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1160939221, now seen corresponding path program 103 times [2019-01-11 11:12:40,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:12:40,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:40,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:12:40,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:40,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:12:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:44,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-01-11 11:12:44,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:44,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:12:44,983 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:12:44,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:12:44,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:44,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:12:44,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:12:44,993 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:12:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:45,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:12:45,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-01-11 11:12:45,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:12:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-01-11 11:12:56,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:12:56,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-01-11 11:12:56,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:12:56,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-11 11:12:56,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-11 11:12:56,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-11 11:12:56,584 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 106 states. [2019-01-11 11:12:58,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:12:58,081 INFO L93 Difference]: Finished difference Result 319 states and 322 transitions. [2019-01-11 11:12:58,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-01-11 11:12:58,082 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2019-01-11 11:12:58,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:12:58,083 INFO L225 Difference]: With dead ends: 319 [2019-01-11 11:12:58,083 INFO L226 Difference]: Without dead ends: 213 [2019-01-11 11:12:58,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-11 11:12:58,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-01-11 11:12:58,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-01-11 11:12:58,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-11 11:12:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2019-01-11 11:12:58,089 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2019-01-11 11:12:58,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:12:58,089 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2019-01-11 11:12:58,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-11 11:12:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2019-01-11 11:12:58,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-11 11:12:58,090 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:12:58,090 INFO L402 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1] [2019-01-11 11:12:58,090 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:12:58,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:58,091 INFO L82 PathProgramCache]: Analyzing trace with hash 193908298, now seen corresponding path program 104 times [2019-01-11 11:12:58,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:12:58,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:58,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:12:58,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:58,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:12:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:02,106 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-01-11 11:13:02,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:02,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:02,107 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:13:02,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:13:02,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:02,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:02,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:13:02,115 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:13:10,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-01-11 11:13:10,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:13:10,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-01-11 11:13:10,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:22,069 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-01-11 11:13:22,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:22,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-01-11 11:13:22,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:22,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-11 11:13:22,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-11 11:13:22,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-11 11:13:22,101 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 107 states. [2019-01-11 11:13:23,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:23,351 INFO L93 Difference]: Finished difference Result 322 states and 325 transitions. [2019-01-11 11:13:23,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-11 11:13:23,351 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2019-01-11 11:13:23,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:23,352 INFO L225 Difference]: With dead ends: 322 [2019-01-11 11:13:23,352 INFO L226 Difference]: Without dead ends: 215 [2019-01-11 11:13:23,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-11 11:13:23,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-11 11:13:23,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-01-11 11:13:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-01-11 11:13:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2019-01-11 11:13:23,357 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 212 [2019-01-11 11:13:23,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:23,357 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2019-01-11 11:13:23,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-11 11:13:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2019-01-11 11:13:23,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-01-11 11:13:23,358 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:23,358 INFO L402 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1, 1] [2019-01-11 11:13:23,358 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:23,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:23,359 INFO L82 PathProgramCache]: Analyzing trace with hash 913063733, now seen corresponding path program 105 times [2019-01-11 11:13:23,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:23,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:23,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:13:23,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:23,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:27,537 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2019-01-11 11:13:27,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:27,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:27,538 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:13:27,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:13:27,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:27,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:27,546 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:13:27,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:13:27,691 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:13:27,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:13:27,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2019-01-11 11:13:27,732 INFO L316 TraceCheckSpWp]: Computing backward predicates...