java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 17:21:02,264 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 17:21:02,267 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 17:21:02,285 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 17:21:02,285 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 17:21:02,286 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 17:21:02,287 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 17:21:02,289 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 17:21:02,291 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 17:21:02,292 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 17:21:02,293 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 17:21:02,293 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 17:21:02,294 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 17:21:02,295 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 17:21:02,297 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 17:21:02,298 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 17:21:02,299 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 17:21:02,301 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 17:21:02,303 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 17:21:02,305 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 17:21:02,306 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 17:21:02,307 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 17:21:02,310 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 17:21:02,310 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 17:21:02,311 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 17:21:02,312 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 17:21:02,313 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 17:21:02,314 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 17:21:02,315 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 17:21:02,316 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 17:21:02,316 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 17:21:02,317 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 17:21:02,317 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 17:21:02,318 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 17:21:02,319 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 17:21:02,320 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 17:21:02,320 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-31 17:21:02,333 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 17:21:02,334 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 17:21:02,334 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 17:21:02,335 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 17:21:02,335 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 17:21:02,335 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 17:21:02,335 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 17:21:02,335 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 17:21:02,336 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 17:21:02,336 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-31 17:21:02,336 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-31 17:21:02,336 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 17:21:02,336 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 17:21:02,337 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 17:21:02,337 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 17:21:02,338 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 17:21:02,338 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 17:21:02,338 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 17:21:02,338 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 17:21:02,338 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 17:21:02,339 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 17:21:02,339 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 17:21:02,339 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 17:21:02,339 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 17:21:02,339 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 17:21:02,340 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 17:21:02,341 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 17:21:02,341 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 17:21:02,341 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 17:21:02,341 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 17:21:02,341 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:21:02,342 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 17:21:02,342 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 17:21:02,342 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 17:21:02,343 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 17:21:02,343 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 17:21:02,343 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 17:21:02,343 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 17:21:02,343 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 17:21:02,382 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 17:21:02,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 17:21:02,398 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 17:21:02,399 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 17:21:02,400 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 17:21:02,401 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-31 17:21:02,401 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2019-01-31 17:21:02,437 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 17:21:02,439 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 17:21:02,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 17:21:02,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 17:21:02,440 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 17:21:02,460 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 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,475 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 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 17:21:02,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 17:21:02,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 17:21:02,488 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 17:21:02,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,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 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,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 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 17:21:02,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 17:21:02,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 17:21:02,514 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 17:21:02,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:21:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 17:21:02,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 17:21:02,826 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 17:21:02,826 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-31 17:21:02,827 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:21:02 BoogieIcfgContainer [2019-01-31 17:21:02,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 17:21:02,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 17:21:02,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 17:21:02,832 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 17:21:02,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/2) ... [2019-01-31 17:21:02,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c935b1 and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:21:02, skipping insertion in model container [2019-01-31 17:21:02,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:21:02" (2/2) ... [2019-01-31 17:21:02,835 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2019-01-31 17:21:02,845 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 17:21:02,852 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 17:21:02,869 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 17:21:02,899 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 17:21:02,899 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 17:21:02,900 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 17:21:02,900 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 17:21:02,900 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 17:21:02,900 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 17:21:02,900 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 17:21:02,901 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 17:21:02,915 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-31 17:21:02,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:21:02,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:02,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:21:02,925 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:02,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:02,932 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-31 17:21:02,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:02,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:02,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:02,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:02,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:03,059 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-31 17:21:03,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:21:03,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 17:21:03,062 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:21:03,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:21:03,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:21:03,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:21:03,079 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-31 17:21:03,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:03,147 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-31 17:21:03,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:21:03,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-31 17:21:03,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:03,161 INFO L225 Difference]: With dead ends: 12 [2019-01-31 17:21:03,161 INFO L226 Difference]: Without dead ends: 7 [2019-01-31 17:21:03,165 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-31 17:21:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-31 17:21:03,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-31 17:21:03,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 17:21:03,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-31 17:21:03,199 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-31 17:21:03,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:03,199 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-31 17:21:03,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:21:03,200 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-31 17:21:03,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:21:03,200 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:03,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:21:03,200 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:03,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:03,201 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-01-31 17:21:03,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:03,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:03,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:03,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:03,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:03,352 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-31 17:21:03,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:03,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:03,355 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:21:03,357 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-01-31 17:21:03,459 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:21:03,459 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:21:05,877 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:21:05,879 INFO L272 AbstractInterpreter]: Visited 6 different actions 34 times. Merged at 2 different actions 14 times. Widened at 2 different actions 6 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:21:05,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:05,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:21:05,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:05,887 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-31 17:21:05,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:05,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:05,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:05,950 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-31 17:21:05,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:06,079 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-31 17:21:06,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:06,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-31 17:21:06,101 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:06,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:21:06,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:21:06,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-31 17:21:06,103 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-01-31 17:21:06,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:06,234 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-01-31 17:21:06,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:21:06,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-31 17:21:06,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:06,236 INFO L225 Difference]: With dead ends: 13 [2019-01-31 17:21:06,236 INFO L226 Difference]: Without dead ends: 9 [2019-01-31 17:21:06,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-31 17:21:06,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-31 17:21:06,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-31 17:21:06,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-31 17:21:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-31 17:21:06,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-01-31 17:21:06,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:06,241 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-31 17:21:06,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:21:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-31 17:21:06,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:21:06,242 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:06,242 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-31 17:21:06,243 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:06,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:06,243 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-01-31 17:21:06,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:06,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:06,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:06,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:06,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:06,387 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-31 17:21:06,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:06,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:06,388 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:06,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:06,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:06,389 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-31 17:21:06,398 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:06,399 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:06,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 17:21:06,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:06,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:06,436 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-31 17:21:06,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:06,605 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-31 17:21:06,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:06,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-31 17:21:06,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:06,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:21:06,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:21:06,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:21:06,641 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-01-31 17:21:06,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:06,798 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-01-31 17:21:06,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:21:06,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-31 17:21:06,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:06,799 INFO L225 Difference]: With dead ends: 16 [2019-01-31 17:21:06,799 INFO L226 Difference]: Without dead ends: 11 [2019-01-31 17:21:06,800 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-31 17:21:06,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-31 17:21:06,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-31 17:21:06,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-31 17:21:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-31 17:21:06,803 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-01-31 17:21:06,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:06,803 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-31 17:21:06,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:21:06,804 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-31 17:21:06,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-31 17:21:06,804 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:06,804 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-01-31 17:21:06,805 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:06,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:06,805 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-01-31 17:21:06,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:06,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:06,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:06,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:06,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:06,930 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-31 17:21:06,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:06,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:06,931 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:06,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:06,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:06,931 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-31 17:21:06,941 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:06,942 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:06,984 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:06,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:06,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:06,990 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-31 17:21:06,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:07,119 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-31 17:21:07,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:07,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-31 17:21:07,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:07,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:21:07,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:21:07,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:21:07,151 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-01-31 17:21:07,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:07,271 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-01-31 17:21:07,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:21:07,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-31 17:21:07,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:07,272 INFO L225 Difference]: With dead ends: 19 [2019-01-31 17:21:07,272 INFO L226 Difference]: Without dead ends: 13 [2019-01-31 17:21:07,273 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-31 17:21:07,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-31 17:21:07,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-31 17:21:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-31 17:21:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-31 17:21:07,276 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-01-31 17:21:07,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:07,276 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-31 17:21:07,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:21:07,276 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-31 17:21:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-31 17:21:07,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:07,277 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-01-31 17:21:07,277 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:07,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:07,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-01-31 17:21:07,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:07,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:07,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:07,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:07,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:07,388 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-31 17:21:07,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:07,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:07,388 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:07,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:07,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:07,389 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-31 17:21:07,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:07,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:07,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:07,417 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-31 17:21:07,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:07,870 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-31 17:21:07,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:07,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-31 17:21:07,888 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:07,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 17:21:07,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 17:21:07,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:21:07,890 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-01-31 17:21:07,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:07,935 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-01-31 17:21:07,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:21:07,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-31 17:21:07,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:07,937 INFO L225 Difference]: With dead ends: 22 [2019-01-31 17:21:07,937 INFO L226 Difference]: Without dead ends: 15 [2019-01-31 17:21:07,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:21:07,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-31 17:21:07,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-31 17:21:07,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-31 17:21:07,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-31 17:21:07,941 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-01-31 17:21:07,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:07,942 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-31 17:21:07,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 17:21:07,942 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-31 17:21:07,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-31 17:21:07,942 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:07,942 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-01-31 17:21:07,943 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:07,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:07,943 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-01-31 17:21:07,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:07,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:07,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:07,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:07,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:08,374 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-31 17:21:08,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:08,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:08,374 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:08,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:08,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:08,375 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-31 17:21:08,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:08,385 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:08,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-31 17:21:08,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:08,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:08,411 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-31 17:21:08,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:08,525 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-31 17:21:08,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:08,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-31 17:21:08,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:08,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:21:08,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:21:08,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:21:08,547 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-01-31 17:21:08,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:08,606 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-01-31 17:21:08,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:21:08,607 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-31 17:21:08,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:08,608 INFO L225 Difference]: With dead ends: 25 [2019-01-31 17:21:08,608 INFO L226 Difference]: Without dead ends: 17 [2019-01-31 17:21:08,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:21:08,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-31 17:21:08,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-31 17:21:08,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-31 17:21:08,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-31 17:21:08,612 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-01-31 17:21:08,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:08,612 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-31 17:21:08,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:21:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-31 17:21:08,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-31 17:21:08,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:08,613 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-01-31 17:21:08,614 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:08,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:08,614 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-01-31 17:21:08,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:08,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:08,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:08,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:08,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:08,731 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-31 17:21:08,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:08,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:08,731 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:08,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:08,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:08,732 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-31 17:21:08,747 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:08,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:08,763 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:08,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:08,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:08,771 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-31 17:21:08,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:08,952 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-31 17:21:08,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:08,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-31 17:21:08,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:08,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:21:08,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:21:08,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:21:08,972 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-01-31 17:21:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:09,044 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-01-31 17:21:09,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:21:09,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-01-31 17:21:09,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:09,045 INFO L225 Difference]: With dead ends: 28 [2019-01-31 17:21:09,046 INFO L226 Difference]: Without dead ends: 19 [2019-01-31 17:21:09,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:21:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-31 17:21:09,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-31 17:21:09,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-31 17:21:09,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-01-31 17:21:09,051 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-01-31 17:21:09,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:09,051 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-01-31 17:21:09,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:21:09,051 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-31 17:21:09,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-31 17:21:09,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:09,052 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-01-31 17:21:09,052 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:09,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:09,053 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-01-31 17:21:09,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:09,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:09,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:09,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:09,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:09,202 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-31 17:21:09,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:09,203 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:09,203 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:09,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:09,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:09,204 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-31 17:21:09,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:09,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:09,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:09,245 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-31 17:21:09,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:09,449 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-31 17:21:09,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:09,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-31 17:21:09,468 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:09,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:21:09,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:21:09,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:21:09,470 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-01-31 17:21:09,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:09,557 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-31 17:21:09,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:21:09,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-01-31 17:21:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:09,560 INFO L225 Difference]: With dead ends: 31 [2019-01-31 17:21:09,560 INFO L226 Difference]: Without dead ends: 21 [2019-01-31 17:21:09,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:21:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-31 17:21:09,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-31 17:21:09,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-31 17:21:09,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-31 17:21:09,564 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-01-31 17:21:09,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:09,565 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-31 17:21:09,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:21:09,565 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-31 17:21:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-31 17:21:09,565 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:09,566 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-01-31 17:21:09,566 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:09,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:09,566 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-01-31 17:21:09,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:09,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:09,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:09,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:09,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:09,693 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-31 17:21:09,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:09,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:09,694 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:09,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:09,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:09,694 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-31 17:21:09,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:09,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:09,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-31 17:21:09,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:09,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:09,739 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-31 17:21:09,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:09,912 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-31 17:21:09,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:09,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-31 17:21:09,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:09,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:21:09,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:21:09,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:21:09,935 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-01-31 17:21:10,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:10,172 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-01-31 17:21:10,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:21:10,173 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-31 17:21:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:10,174 INFO L225 Difference]: With dead ends: 34 [2019-01-31 17:21:10,174 INFO L226 Difference]: Without dead ends: 23 [2019-01-31 17:21:10,175 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-31 17:21:10,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-31 17:21:10,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-31 17:21:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-31 17:21:10,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-31 17:21:10,179 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-01-31 17:21:10,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:10,179 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-31 17:21:10,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:21:10,179 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-31 17:21:10,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-31 17:21:10,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:10,180 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-01-31 17:21:10,180 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:10,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:10,180 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-01-31 17:21:10,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:10,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:10,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:10,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:10,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:10,349 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-31 17:21:10,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:10,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:10,350 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:10,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:10,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:10,350 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-31 17:21:10,361 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:10,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:10,382 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:10,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:10,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:10,389 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-31 17:21:10,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:10,647 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-31 17:21:10,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:10,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-31 17:21:10,666 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:10,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:21:10,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:21:10,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-31 17:21:10,667 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-01-31 17:21:10,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:10,754 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-01-31 17:21:10,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 17:21:10,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-01-31 17:21:10,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:10,762 INFO L225 Difference]: With dead ends: 37 [2019-01-31 17:21:10,762 INFO L226 Difference]: Without dead ends: 25 [2019-01-31 17:21:10,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-31 17:21:10,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-31 17:21:10,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-31 17:21:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-31 17:21:10,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-31 17:21:10,769 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-01-31 17:21:10,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:10,769 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-31 17:21:10,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:21:10,774 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-31 17:21:10,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-31 17:21:10,775 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:10,775 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-01-31 17:21:10,775 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:10,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:10,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-01-31 17:21:10,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:10,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:10,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:10,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:10,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:11,083 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-31 17:21:11,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:11,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:11,084 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:11,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:11,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:11,084 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-31 17:21:11,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:11,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:11,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:11,130 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-31 17:21:11,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:11,531 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-31 17:21:11,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:11,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-31 17:21:11,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:11,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:21:11,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:21:11,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-31 17:21:11,552 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-01-31 17:21:11,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:11,602 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-01-31 17:21:11,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-31 17:21:11,604 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-01-31 17:21:11,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:11,605 INFO L225 Difference]: With dead ends: 40 [2019-01-31 17:21:11,605 INFO L226 Difference]: Without dead ends: 27 [2019-01-31 17:21:11,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-31 17:21:11,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-31 17:21:11,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-31 17:21:11,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-31 17:21:11,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-31 17:21:11,609 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-01-31 17:21:11,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:11,609 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-31 17:21:11,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:21:11,610 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-31 17:21:11,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-31 17:21:11,610 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:11,610 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-01-31 17:21:11,610 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:11,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:11,611 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-01-31 17:21:11,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:11,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:11,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:11,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:11,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:11,965 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-31 17:21:11,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:11,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:11,965 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:11,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:11,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:11,966 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-31 17:21:11,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:11,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:12,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-31 17:21:12,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:12,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:12,009 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-31 17:21:12,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:12,228 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-31 17:21:12,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:12,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-01-31 17:21:12,247 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:12,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-31 17:21:12,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-31 17:21:12,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-31 17:21:12,249 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-01-31 17:21:12,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:12,301 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-01-31 17:21:12,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-31 17:21:12,302 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-01-31 17:21:12,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:12,302 INFO L225 Difference]: With dead ends: 43 [2019-01-31 17:21:12,303 INFO L226 Difference]: Without dead ends: 29 [2019-01-31 17:21:12,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-31 17:21:12,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-31 17:21:12,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-31 17:21:12,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-31 17:21:12,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-31 17:21:12,307 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-01-31 17:21:12,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:12,308 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-31 17:21:12,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-31 17:21:12,308 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-31 17:21:12,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-31 17:21:12,309 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:12,309 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-01-31 17:21:12,309 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:12,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:12,309 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-01-31 17:21:12,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:12,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:12,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:12,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:12,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:12,454 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-31 17:21:12,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:12,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:12,455 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:12,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:12,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:12,456 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-31 17:21:12,464 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:12,464 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:12,484 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:12,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:12,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:12,492 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-31 17:21:12,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:12,712 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-31 17:21:12,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:12,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-31 17:21:12,733 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:12,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-31 17:21:12,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-31 17:21:12,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-31 17:21:12,734 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-01-31 17:21:12,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:12,825 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-01-31 17:21:12,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-31 17:21:12,826 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-01-31 17:21:12,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:12,827 INFO L225 Difference]: With dead ends: 46 [2019-01-31 17:21:12,827 INFO L226 Difference]: Without dead ends: 31 [2019-01-31 17:21:12,828 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-31 17:21:12,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-31 17:21:12,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-31 17:21:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-31 17:21:12,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-01-31 17:21:12,833 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-01-31 17:21:12,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:12,833 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-01-31 17:21:12,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-31 17:21:12,834 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-31 17:21:12,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-31 17:21:12,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:12,834 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-01-31 17:21:12,835 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:12,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:12,835 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-01-31 17:21:12,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:12,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:12,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:12,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:12,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:12,996 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-31 17:21:12,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:12,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:12,997 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:12,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:12,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:12,997 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-31 17:21:13,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:13,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:13,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:13,049 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-31 17:21:13,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:13,414 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-31 17:21:13,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:13,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-31 17:21:13,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:13,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-31 17:21:13,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-31 17:21:13,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-31 17:21:13,435 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-01-31 17:21:13,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:13,500 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-01-31 17:21:13,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-31 17:21:13,500 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-31 17:21:13,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:13,501 INFO L225 Difference]: With dead ends: 49 [2019-01-31 17:21:13,501 INFO L226 Difference]: Without dead ends: 33 [2019-01-31 17:21:13,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-31 17:21:13,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-31 17:21:13,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-31 17:21:13,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-31 17:21:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-31 17:21:13,507 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-01-31 17:21:13,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:13,508 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-31 17:21:13,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-31 17:21:13,508 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-31 17:21:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-31 17:21:13,509 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:13,509 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-01-31 17:21:13,509 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:13,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:13,510 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-01-31 17:21:13,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:13,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:13,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:13,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:13,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:13,687 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-31 17:21:13,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:13,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:13,687 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:13,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:13,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:13,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:21:13,696 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:13,696 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:13,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-31 17:21:13,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:13,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:13,745 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-31 17:21:13,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:14,164 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-31 17:21:14,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:14,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-01-31 17:21:14,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:14,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-31 17:21:14,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-31 17:21:14,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-31 17:21:14,187 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-01-31 17:21:14,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:14,257 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-01-31 17:21:14,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-31 17:21:14,258 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-01-31 17:21:14,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:14,259 INFO L225 Difference]: With dead ends: 52 [2019-01-31 17:21:14,259 INFO L226 Difference]: Without dead ends: 35 [2019-01-31 17:21:14,260 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-31 17:21:14,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-31 17:21:14,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-31 17:21:14,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-31 17:21:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-31 17:21:14,264 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-01-31 17:21:14,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:14,264 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-31 17:21:14,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-31 17:21:14,264 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-31 17:21:14,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-31 17:21:14,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:14,265 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-01-31 17:21:14,265 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:14,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:14,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-01-31 17:21:14,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:14,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:14,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:14,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:14,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:14,464 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-31 17:21:14,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:14,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:14,465 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:14,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:14,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:14,465 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-31 17:21:14,474 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:14,474 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:14,500 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:14,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:14,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:14,509 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-31 17:21:14,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:14,960 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-31 17:21:14,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:14,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-31 17:21:14,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:14,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-31 17:21:14,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-31 17:21:14,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-31 17:21:14,980 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-01-31 17:21:15,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:15,121 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-01-31 17:21:15,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-31 17:21:15,121 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-01-31 17:21:15,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:15,122 INFO L225 Difference]: With dead ends: 55 [2019-01-31 17:21:15,122 INFO L226 Difference]: Without dead ends: 37 [2019-01-31 17:21:15,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-31 17:21:15,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-31 17:21:15,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-31 17:21:15,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-31 17:21:15,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-31 17:21:15,126 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-01-31 17:21:15,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:15,127 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-31 17:21:15,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-31 17:21:15,127 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-31 17:21:15,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-31 17:21:15,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:15,128 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-01-31 17:21:15,128 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:15,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:15,128 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-01-31 17:21:15,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:15,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:15,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:15,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:15,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:15,787 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-31 17:21:15,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:15,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:15,788 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:15,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:15,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:15,789 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-31 17:21:15,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:15,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:15,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:15,833 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-31 17:21:15,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:16,560 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-31 17:21:16,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:16,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-31 17:21:16,579 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:16,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-31 17:21:16,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-31 17:21:16,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-31 17:21:16,580 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-01-31 17:21:16,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:16,646 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-01-31 17:21:16,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-31 17:21:16,646 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-01-31 17:21:16,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:16,647 INFO L225 Difference]: With dead ends: 58 [2019-01-31 17:21:16,647 INFO L226 Difference]: Without dead ends: 39 [2019-01-31 17:21:16,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-31 17:21:16,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-31 17:21:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-31 17:21:16,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-31 17:21:16,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-31 17:21:16,653 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-01-31 17:21:16,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:16,653 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-31 17:21:16,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-31 17:21:16,654 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-31 17:21:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-31 17:21:16,654 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:16,654 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-01-31 17:21:16,655 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:16,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:16,655 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-01-31 17:21:16,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:16,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:16,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:16,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:16,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:17,594 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-31 17:21:17,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:17,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:17,594 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:17,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:17,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:17,595 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-31 17:21:17,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:17,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:17,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-31 17:21:17,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:17,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:17,664 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-31 17:21:17,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:18,304 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-31 17:21:18,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:18,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-31 17:21:18,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:18,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-31 17:21:18,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-31 17:21:18,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-31 17:21:18,325 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-01-31 17:21:18,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:18,397 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-01-31 17:21:18,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-31 17:21:18,398 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-01-31 17:21:18,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:18,399 INFO L225 Difference]: With dead ends: 61 [2019-01-31 17:21:18,399 INFO L226 Difference]: Without dead ends: 41 [2019-01-31 17:21:18,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-31 17:21:18,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-31 17:21:18,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-31 17:21:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-31 17:21:18,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-31 17:21:18,405 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-01-31 17:21:18,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:18,406 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-31 17:21:18,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-31 17:21:18,406 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-31 17:21:18,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-31 17:21:18,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:18,407 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-01-31 17:21:18,407 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:18,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:18,407 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-01-31 17:21:18,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:18,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:18,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:18,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:18,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:18,867 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-31 17:21:18,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:18,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:18,868 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:18,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:18,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:18,869 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-31 17:21:18,877 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:18,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:18,907 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:18,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:18,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:18,916 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-31 17:21:18,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:19,398 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-31 17:21:19,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:19,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-31 17:21:19,417 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:19,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-31 17:21:19,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-31 17:21:19,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-31 17:21:19,419 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-01-31 17:21:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:19,649 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-01-31 17:21:19,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-31 17:21:19,649 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-01-31 17:21:19,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:19,650 INFO L225 Difference]: With dead ends: 64 [2019-01-31 17:21:19,650 INFO L226 Difference]: Without dead ends: 43 [2019-01-31 17:21:19,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-31 17:21:19,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-31 17:21:19,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-31 17:21:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-31 17:21:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-31 17:21:19,655 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-01-31 17:21:19,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:19,655 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-31 17:21:19,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-31 17:21:19,656 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-31 17:21:19,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-31 17:21:19,656 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:19,656 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-01-31 17:21:19,657 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:19,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:19,657 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-01-31 17:21:19,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:19,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:19,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:19,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:19,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:20,706 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-31 17:21:20,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:20,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:20,707 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:20,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:20,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:20,708 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-31 17:21:20,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:20,725 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:20,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:20,761 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-31 17:21:20,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:21,235 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-31 17:21:21,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:21,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-31 17:21:21,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:21,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-31 17:21:21,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-31 17:21:21,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-31 17:21:21,255 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-01-31 17:21:21,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:21,325 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-31 17:21:21,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-31 17:21:21,325 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-01-31 17:21:21,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:21,326 INFO L225 Difference]: With dead ends: 67 [2019-01-31 17:21:21,326 INFO L226 Difference]: Without dead ends: 45 [2019-01-31 17:21:21,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-31 17:21:21,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-31 17:21:21,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-31 17:21:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-31 17:21:21,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-31 17:21:21,333 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-01-31 17:21:21,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:21,333 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-31 17:21:21,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-31 17:21:21,333 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-31 17:21:21,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-31 17:21:21,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:21,334 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-01-31 17:21:21,334 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:21,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:21,335 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-01-31 17:21:21,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:21,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:21,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:21,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:21,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:21,679 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-31 17:21:21,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:21,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:21,679 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:21,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:21,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:21,680 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-31 17:21:21,690 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:21,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:21,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-31 17:21:21,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:21,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:21,762 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-31 17:21:21,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:22,252 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-31 17:21:22,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:22,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-31 17:21:22,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:22,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-31 17:21:22,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-31 17:21:22,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-31 17:21:22,274 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-01-31 17:21:22,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:22,348 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-01-31 17:21:22,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-31 17:21:22,348 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-01-31 17:21:22,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:22,349 INFO L225 Difference]: With dead ends: 70 [2019-01-31 17:21:22,349 INFO L226 Difference]: Without dead ends: 47 [2019-01-31 17:21:22,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-31 17:21:22,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-31 17:21:22,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-31 17:21:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-31 17:21:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-31 17:21:22,356 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-01-31 17:21:22,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:22,356 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-31 17:21:22,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-31 17:21:22,357 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-31 17:21:22,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-31 17:21:22,357 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:22,358 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-01-31 17:21:22,358 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:22,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:22,358 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-01-31 17:21:22,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:22,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:22,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:22,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:22,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:22,775 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-31 17:21:22,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:22,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:22,775 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:22,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:22,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:22,776 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-31 17:21:22,786 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:22,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:22,822 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:22,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:22,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:22,834 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-31 17:21:22,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:23,420 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-31 17:21:23,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:23,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-31 17:21:23,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:23,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-31 17:21:23,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-31 17:21:23,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-31 17:21:23,443 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-01-31 17:21:23,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:23,544 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-01-31 17:21:23,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-31 17:21:23,547 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-01-31 17:21:23,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:23,548 INFO L225 Difference]: With dead ends: 73 [2019-01-31 17:21:23,548 INFO L226 Difference]: Without dead ends: 49 [2019-01-31 17:21:23,549 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-31 17:21:23,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-31 17:21:23,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-31 17:21:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-31 17:21:23,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-31 17:21:23,552 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-01-31 17:21:23,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:23,553 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-31 17:21:23,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-31 17:21:23,553 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-31 17:21:23,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-31 17:21:23,554 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:23,554 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-01-31 17:21:23,554 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:23,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:23,554 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-01-31 17:21:23,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:23,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:23,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:23,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:23,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:23,862 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-31 17:21:23,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:23,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:23,863 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:23,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:23,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:23,863 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-31 17:21:23,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:23,871 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:23,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:23,912 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-31 17:21:23,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:24,484 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-31 17:21:24,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:24,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-31 17:21:24,503 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:24,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-31 17:21:24,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-31 17:21:24,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-31 17:21:24,505 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-01-31 17:21:24,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:24,638 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-01-31 17:21:24,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-31 17:21:24,640 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-01-31 17:21:24,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:24,641 INFO L225 Difference]: With dead ends: 76 [2019-01-31 17:21:24,641 INFO L226 Difference]: Without dead ends: 51 [2019-01-31 17:21:24,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-31 17:21:24,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-31 17:21:24,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-31 17:21:24,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-31 17:21:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-01-31 17:21:24,645 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-01-31 17:21:24,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:24,646 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-01-31 17:21:24,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-31 17:21:24,646 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-01-31 17:21:24,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-31 17:21:24,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:24,647 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-01-31 17:21:24,647 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:24,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:24,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-01-31 17:21:24,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:24,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:24,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:24,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:24,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:25,177 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-31 17:21:25,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:25,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:25,177 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:25,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:25,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:25,178 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-31 17:21:25,187 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:25,187 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:25,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-31 17:21:25,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:25,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:25,279 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-31 17:21:25,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:26,208 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-31 17:21:26,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:26,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-01-31 17:21:26,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:26,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-31 17:21:26,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-31 17:21:26,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-31 17:21:26,232 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-01-31 17:21:26,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:26,325 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-01-31 17:21:26,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-31 17:21:26,326 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-01-31 17:21:26,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:26,326 INFO L225 Difference]: With dead ends: 79 [2019-01-31 17:21:26,327 INFO L226 Difference]: Without dead ends: 53 [2019-01-31 17:21:26,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-31 17:21:26,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-31 17:21:26,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-31 17:21:26,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-31 17:21:26,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-31 17:21:26,331 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-01-31 17:21:26,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:26,331 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-31 17:21:26,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-31 17:21:26,331 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-31 17:21:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-31 17:21:26,332 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:26,332 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-01-31 17:21:26,332 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:26,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:26,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-01-31 17:21:26,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:26,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:26,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:26,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:26,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:26,649 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-31 17:21:26,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:26,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:26,650 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:26,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:26,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:26,650 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-31 17:21:26,662 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:26,662 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:26,708 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:26,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:26,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:26,717 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-31 17:21:26,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:27,403 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-31 17:21:27,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:27,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-31 17:21:27,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:27,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-31 17:21:27,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-31 17:21:27,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-31 17:21:27,424 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-01-31 17:21:27,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:27,530 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-01-31 17:21:27,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-31 17:21:27,530 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-01-31 17:21:27,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:27,531 INFO L225 Difference]: With dead ends: 82 [2019-01-31 17:21:27,531 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 17:21:27,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-31 17:21:27,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 17:21:27,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-31 17:21:27,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-31 17:21:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-01-31 17:21:27,536 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-01-31 17:21:27,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:27,536 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-01-31 17:21:27,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-31 17:21:27,537 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-01-31 17:21:27,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-31 17:21:27,537 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:27,537 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-01-31 17:21:27,538 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:27,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:27,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-01-31 17:21:27,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:27,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:27,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:27,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:27,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:28,165 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-31 17:21:28,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:28,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:28,166 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:28,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:28,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:28,166 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-31 17:21:28,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:28,174 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:28,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:28,221 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-31 17:21:28,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:28,937 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-31 17:21:28,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:28,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-31 17:21:28,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:28,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-31 17:21:28,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-31 17:21:28,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-31 17:21:28,958 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-01-31 17:21:29,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:29,158 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-01-31 17:21:29,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-31 17:21:29,158 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-01-31 17:21:29,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:29,159 INFO L225 Difference]: With dead ends: 85 [2019-01-31 17:21:29,159 INFO L226 Difference]: Without dead ends: 57 [2019-01-31 17:21:29,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-31 17:21:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-31 17:21:29,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-31 17:21:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-31 17:21:29,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-31 17:21:29,164 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-01-31 17:21:29,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:29,164 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-31 17:21:29,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-31 17:21:29,165 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-31 17:21:29,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-31 17:21:29,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:29,165 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-01-31 17:21:29,166 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:29,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:29,166 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-01-31 17:21:29,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:29,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:29,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:29,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:29,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:29,550 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-31 17:21:29,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:29,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:29,550 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:29,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:29,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:29,551 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-31 17:21:29,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:29,560 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:29,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-31 17:21:29,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:29,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:29,673 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-31 17:21:29,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:30,447 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-31 17:21:30,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:30,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-01-31 17:21:30,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:30,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-31 17:21:30,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-31 17:21:30,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-31 17:21:30,468 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-01-31 17:21:30,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:30,596 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-01-31 17:21:30,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-31 17:21:30,596 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-01-31 17:21:30,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:30,597 INFO L225 Difference]: With dead ends: 88 [2019-01-31 17:21:30,597 INFO L226 Difference]: Without dead ends: 59 [2019-01-31 17:21:30,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-31 17:21:30,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-31 17:21:30,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-31 17:21:30,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-31 17:21:30,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-31 17:21:30,600 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-01-31 17:21:30,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:30,600 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-31 17:21:30,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-31 17:21:30,600 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-31 17:21:30,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-31 17:21:30,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:30,601 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-01-31 17:21:30,602 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:30,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:30,602 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-01-31 17:21:30,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:30,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:30,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:30,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:30,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:31,133 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-31 17:21:31,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:31,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:31,133 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:31,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:31,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:31,133 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-31 17:21:31,145 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:31,145 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:31,187 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:31,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:31,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:31,198 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-31 17:21:31,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:32,518 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-31 17:21:32,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:32,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-31 17:21:32,537 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:32,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-31 17:21:32,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-31 17:21:32,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-31 17:21:32,539 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-01-31 17:21:32,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:32,663 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-01-31 17:21:32,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-31 17:21:32,663 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-01-31 17:21:32,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:32,664 INFO L225 Difference]: With dead ends: 91 [2019-01-31 17:21:32,664 INFO L226 Difference]: Without dead ends: 61 [2019-01-31 17:21:32,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-31 17:21:32,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-31 17:21:32,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-31 17:21:32,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-31 17:21:32,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-01-31 17:21:32,668 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-01-31 17:21:32,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:32,668 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-01-31 17:21:32,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-31 17:21:32,668 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-01-31 17:21:32,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-31 17:21:32,669 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:32,669 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-01-31 17:21:32,669 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:32,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:32,670 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-01-31 17:21:32,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:32,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:32,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:32,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:32,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:33,279 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-31 17:21:33,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:33,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:33,279 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:33,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:33,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:33,280 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-31 17:21:33,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:33,295 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:33,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:33,360 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-31 17:21:33,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:34,512 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-31 17:21:34,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:34,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-31 17:21:34,531 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:34,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-31 17:21:34,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-31 17:21:34,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-31 17:21:34,532 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-01-31 17:21:34,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:34,648 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-01-31 17:21:34,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-31 17:21:34,649 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-01-31 17:21:34,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:34,650 INFO L225 Difference]: With dead ends: 94 [2019-01-31 17:21:34,650 INFO L226 Difference]: Without dead ends: 63 [2019-01-31 17:21:34,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-31 17:21:34,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-31 17:21:34,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-31 17:21:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-31 17:21:34,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-01-31 17:21:34,653 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-01-31 17:21:34,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:34,654 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-01-31 17:21:34,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-31 17:21:34,654 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-01-31 17:21:34,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-31 17:21:34,654 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:34,654 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-01-31 17:21:34,655 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:34,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:34,655 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-01-31 17:21:34,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:34,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:34,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:34,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:34,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:35,108 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-31 17:21:35,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:35,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:35,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:35,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:35,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:35,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:21:35,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:35,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:35,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-31 17:21:35,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:35,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:35,284 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-31 17:21:35,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:36,526 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-31 17:21:36,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:36,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-01-31 17:21:36,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:36,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-31 17:21:36,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-31 17:21:36,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-31 17:21:36,548 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-01-31 17:21:36,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:36,656 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-01-31 17:21:36,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-31 17:21:36,657 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-01-31 17:21:36,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:36,657 INFO L225 Difference]: With dead ends: 97 [2019-01-31 17:21:36,658 INFO L226 Difference]: Without dead ends: 65 [2019-01-31 17:21:36,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-31 17:21:36,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-31 17:21:36,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-31 17:21:36,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-31 17:21:36,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-31 17:21:36,660 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-01-31 17:21:36,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:36,661 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-31 17:21:36,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-31 17:21:36,661 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-31 17:21:36,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-31 17:21:36,661 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:36,661 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-01-31 17:21:36,661 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:36,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:36,662 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-01-31 17:21:36,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:36,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:36,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:36,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:36,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:37,130 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-31 17:21:37,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:37,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:37,130 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:37,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:37,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:37,130 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-31 17:21:37,140 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:37,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:37,186 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:37,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:37,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:37,196 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-31 17:21:37,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:38,234 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-31 17:21:38,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:38,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-31 17:21:38,252 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:38,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-31 17:21:38,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-31 17:21:38,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-31 17:21:38,254 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-01-31 17:21:38,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:38,401 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-01-31 17:21:38,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-31 17:21:38,402 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-01-31 17:21:38,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:38,403 INFO L225 Difference]: With dead ends: 100 [2019-01-31 17:21:38,403 INFO L226 Difference]: Without dead ends: 67 [2019-01-31 17:21:38,404 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-31 17:21:38,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-31 17:21:38,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-31 17:21:38,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-31 17:21:38,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-01-31 17:21:38,405 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-01-31 17:21:38,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:38,406 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-01-31 17:21:38,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-31 17:21:38,406 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-01-31 17:21:38,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-31 17:21:38,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:38,406 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-01-31 17:21:38,407 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:38,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:38,407 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-01-31 17:21:38,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:38,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:38,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:38,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:38,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:38,918 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-31 17:21:38,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:38,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:38,919 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:38,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:38,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:38,919 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-31 17:21:38,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:38,928 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:38,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:38,990 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-31 17:21:38,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:40,094 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-31 17:21:40,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:40,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-31 17:21:40,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:40,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-31 17:21:40,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-31 17:21:40,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-31 17:21:40,116 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-01-31 17:21:40,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:40,258 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-01-31 17:21:40,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-31 17:21:40,259 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-01-31 17:21:40,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:40,259 INFO L225 Difference]: With dead ends: 103 [2019-01-31 17:21:40,260 INFO L226 Difference]: Without dead ends: 69 [2019-01-31 17:21:40,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-31 17:21:40,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-31 17:21:40,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-31 17:21:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-31 17:21:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-31 17:21:40,264 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-01-31 17:21:40,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:40,264 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-31 17:21:40,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-31 17:21:40,264 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-31 17:21:40,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-31 17:21:40,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:40,265 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-01-31 17:21:40,265 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:40,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:40,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-01-31 17:21:40,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:40,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:40,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:40,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:40,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:41,456 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-31 17:21:41,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:41,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:41,457 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:41,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:41,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:41,457 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-31 17:21:41,465 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:41,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:41,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-31 17:21:41,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:41,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:41,639 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-31 17:21:41,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:42,831 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-31 17:21:42,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:42,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-31 17:21:42,851 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:42,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-31 17:21:42,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-31 17:21:42,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-31 17:21:42,853 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-01-31 17:21:42,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:42,999 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-01-31 17:21:42,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-31 17:21:43,000 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-01-31 17:21:43,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:43,001 INFO L225 Difference]: With dead ends: 106 [2019-01-31 17:21:43,001 INFO L226 Difference]: Without dead ends: 71 [2019-01-31 17:21:43,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-31 17:21:43,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-31 17:21:43,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-31 17:21:43,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-31 17:21:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-31 17:21:43,005 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-01-31 17:21:43,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:43,005 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-31 17:21:43,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-31 17:21:43,006 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-31 17:21:43,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-31 17:21:43,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:43,006 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-01-31 17:21:43,006 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:43,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:43,006 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-01-31 17:21:43,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:43,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:43,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:43,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:43,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:43,626 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-31 17:21:43,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:43,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:43,627 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:43,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:43,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:43,627 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-31 17:21:43,635 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:43,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:43,687 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:43,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:43,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:43,697 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-31 17:21:43,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:44,941 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-31 17:21:44,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:44,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-31 17:21:44,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:44,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-31 17:21:44,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-31 17:21:44,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-31 17:21:44,962 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-01-31 17:21:45,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:45,154 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-01-31 17:21:45,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-31 17:21:45,154 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-01-31 17:21:45,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:45,155 INFO L225 Difference]: With dead ends: 109 [2019-01-31 17:21:45,155 INFO L226 Difference]: Without dead ends: 73 [2019-01-31 17:21:45,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-31 17:21:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-31 17:21:45,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-31 17:21:45,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-31 17:21:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-01-31 17:21:45,159 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-01-31 17:21:45,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:45,159 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-01-31 17:21:45,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-31 17:21:45,159 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-01-31 17:21:45,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-31 17:21:45,160 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:45,160 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-01-31 17:21:45,160 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:45,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:45,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-01-31 17:21:45,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:45,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:45,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:45,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:45,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:45,877 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-31 17:21:45,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:45,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:45,878 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:45,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:45,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:45,878 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-31 17:21:45,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:45,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:45,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:45,948 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-31 17:21:45,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:47,368 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-31 17:21:47,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:47,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-31 17:21:47,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:47,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-31 17:21:47,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-31 17:21:47,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-31 17:21:47,388 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-01-31 17:21:47,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:47,563 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-01-31 17:21:47,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-31 17:21:47,563 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-01-31 17:21:47,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:47,564 INFO L225 Difference]: With dead ends: 112 [2019-01-31 17:21:47,564 INFO L226 Difference]: Without dead ends: 75 [2019-01-31 17:21:47,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-31 17:21:47,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-31 17:21:47,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-31 17:21:47,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-31 17:21:47,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-01-31 17:21:47,568 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-01-31 17:21:47,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:47,568 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-01-31 17:21:47,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-31 17:21:47,568 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-01-31 17:21:47,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-31 17:21:47,569 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:47,569 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-01-31 17:21:47,569 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:47,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:47,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-01-31 17:21:47,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:47,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:47,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:47,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:47,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:48,193 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-31 17:21:48,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:48,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:48,193 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:48,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:48,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:48,194 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-31 17:21:48,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:48,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:48,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-31 17:21:48,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:48,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:48,582 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-31 17:21:48,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:49,958 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-31 17:21:49,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:49,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-31 17:21:49,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:49,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-31 17:21:49,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-31 17:21:49,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-31 17:21:49,978 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-01-31 17:21:50,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:50,114 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-01-31 17:21:50,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-31 17:21:50,114 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-01-31 17:21:50,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:50,115 INFO L225 Difference]: With dead ends: 115 [2019-01-31 17:21:50,115 INFO L226 Difference]: Without dead ends: 77 [2019-01-31 17:21:50,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-31 17:21:50,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-31 17:21:50,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-31 17:21:50,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-31 17:21:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-31 17:21:50,118 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-01-31 17:21:50,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:50,118 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-31 17:21:50,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-31 17:21:50,118 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-31 17:21:50,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-31 17:21:50,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:50,119 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-01-31 17:21:50,119 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:50,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:50,119 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-01-31 17:21:50,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:50,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:50,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:50,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:50,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:50,726 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-31 17:21:50,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:50,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:50,727 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:50,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:50,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:50,727 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-31 17:21:50,735 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:50,735 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:50,807 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:50,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:50,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:50,821 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-31 17:21:50,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:52,567 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-31 17:21:52,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:52,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-31 17:21:52,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:52,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-31 17:21:52,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-31 17:21:52,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-31 17:21:52,588 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-01-31 17:21:52,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:52,739 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-01-31 17:21:52,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-31 17:21:52,739 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-01-31 17:21:52,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:52,740 INFO L225 Difference]: With dead ends: 118 [2019-01-31 17:21:52,740 INFO L226 Difference]: Without dead ends: 79 [2019-01-31 17:21:52,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-31 17:21:52,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-31 17:21:52,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-31 17:21:52,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-31 17:21:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-01-31 17:21:52,744 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-01-31 17:21:52,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:52,744 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-01-31 17:21:52,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-31 17:21:52,744 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-01-31 17:21:52,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-31 17:21:52,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:52,745 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-01-31 17:21:52,745 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:52,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:52,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-01-31 17:21:52,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:52,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:52,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:52,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:52,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:53,405 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-31 17:21:53,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:53,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:53,405 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:53,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:53,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:53,405 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-31 17:21:53,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:53,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:53,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:53,483 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-31 17:21:53,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:55,006 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-31 17:21:55,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:55,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-31 17:21:55,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:55,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-31 17:21:55,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-31 17:21:55,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-31 17:21:55,026 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-01-31 17:21:55,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:55,171 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-01-31 17:21:55,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-31 17:21:55,171 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-01-31 17:21:55,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:55,172 INFO L225 Difference]: With dead ends: 121 [2019-01-31 17:21:55,172 INFO L226 Difference]: Without dead ends: 81 [2019-01-31 17:21:55,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-31 17:21:55,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-31 17:21:55,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-31 17:21:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-31 17:21:55,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-01-31 17:21:55,175 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-01-31 17:21:55,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:55,175 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-01-31 17:21:55,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-31 17:21:55,176 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-01-31 17:21:55,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-31 17:21:55,176 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:55,176 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-01-31 17:21:55,176 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:55,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:55,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-01-31 17:21:55,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:55,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:55,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:55,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:55,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:56,510 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-31 17:21:56,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:56,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:56,511 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:56,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:56,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:56,511 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-31 17:21:56,520 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:56,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:56,889 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-31 17:21:56,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:56,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:56,907 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-31 17:21:56,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:58,615 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-31 17:21:58,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:58,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-31 17:21:58,636 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:58,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-31 17:21:58,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-31 17:21:58,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-31 17:21:58,637 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-01-31 17:21:58,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:58,795 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-01-31 17:21:58,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-31 17:21:58,795 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-01-31 17:21:58,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:58,796 INFO L225 Difference]: With dead ends: 124 [2019-01-31 17:21:58,796 INFO L226 Difference]: Without dead ends: 83 [2019-01-31 17:21:58,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-31 17:21:58,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-31 17:21:58,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-31 17:21:58,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-31 17:21:58,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-01-31 17:21:58,799 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-01-31 17:21:58,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:58,800 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-01-31 17:21:58,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-31 17:21:58,800 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-01-31 17:21:58,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-31 17:21:58,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:58,801 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-01-31 17:21:58,801 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:58,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:58,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-01-31 17:21:58,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:58,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:58,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:58,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:58,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:59,643 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-31 17:21:59,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:59,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:59,644 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:59,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:59,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:59,644 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-31 17:21:59,653 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:59,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:59,723 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:59,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:59,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:59,736 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-31 17:21:59,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:01,590 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-31 17:22:01,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:01,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-31 17:22:01,610 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:01,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-31 17:22:01,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-31 17:22:01,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-31 17:22:01,611 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-01-31 17:22:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:01,763 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-01-31 17:22:01,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-31 17:22:01,764 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-01-31 17:22:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:01,765 INFO L225 Difference]: With dead ends: 127 [2019-01-31 17:22:01,765 INFO L226 Difference]: Without dead ends: 85 [2019-01-31 17:22:01,766 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-31 17:22:01,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-31 17:22:01,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-31 17:22:01,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-31 17:22:01,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-01-31 17:22:01,769 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-01-31 17:22:01,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:01,770 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-01-31 17:22:01,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-31 17:22:01,770 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-01-31 17:22:01,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-31 17:22:01,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:01,771 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-01-31 17:22:01,771 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:01,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:01,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-01-31 17:22:01,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:01,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:01,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:01,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:01,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:03,284 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-31 17:22:03,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:03,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:03,284 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:03,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:03,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:03,284 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-31 17:22:03,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:03,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:22:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:03,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:03,362 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-31 17:22:03,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:05,278 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-31 17:22:05,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:05,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-31 17:22:05,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:05,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-31 17:22:05,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-31 17:22:05,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-31 17:22:05,299 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-01-31 17:22:05,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:05,470 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-01-31 17:22:05,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-31 17:22:05,470 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-01-31 17:22:05,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:05,471 INFO L225 Difference]: With dead ends: 130 [2019-01-31 17:22:05,471 INFO L226 Difference]: Without dead ends: 87 [2019-01-31 17:22:05,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-31 17:22:05,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-31 17:22:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-31 17:22:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-31 17:22:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-01-31 17:22:05,476 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-01-31 17:22:05,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:05,476 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-01-31 17:22:05,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-31 17:22:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-01-31 17:22:05,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-31 17:22:05,477 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:05,477 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-01-31 17:22:05,477 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:05,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:05,477 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-01-31 17:22:05,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:05,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:05,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:05,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:05,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:06,835 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-31 17:22:06,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:06,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:06,836 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:06,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:06,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:06,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 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-31 17:22:06,844 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:22:06,845 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:22:07,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-31 17:22:07,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:07,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:07,190 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-31 17:22:07,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:09,069 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-31 17:22:09,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:09,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-31 17:22:09,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:09,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-31 17:22:09,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-31 17:22:09,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-31 17:22:09,090 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-01-31 17:22:09,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:09,262 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-01-31 17:22:09,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-31 17:22:09,263 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-01-31 17:22:09,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:09,263 INFO L225 Difference]: With dead ends: 133 [2019-01-31 17:22:09,264 INFO L226 Difference]: Without dead ends: 89 [2019-01-31 17:22:09,264 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-31 17:22:09,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-31 17:22:09,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-31 17:22:09,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-31 17:22:09,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-01-31 17:22:09,267 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-01-31 17:22:09,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:09,267 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-01-31 17:22:09,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-31 17:22:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-01-31 17:22:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-31 17:22:09,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:09,268 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-01-31 17:22:09,269 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:09,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:09,269 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-01-31 17:22:09,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:09,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:09,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:09,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:09,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:10,049 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-31 17:22:10,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:10,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:10,050 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:10,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:10,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:10,050 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-31 17:22:10,060 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:22:10,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:22:10,119 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:22:10,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:10,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:10,137 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-31 17:22:10,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:12,460 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-31 17:22:12,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:12,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-31 17:22:12,480 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:12,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-31 17:22:12,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-31 17:22:12,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-31 17:22:12,481 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-01-31 17:22:12,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:12,657 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-01-31 17:22:12,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-31 17:22:12,657 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-01-31 17:22:12,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:12,658 INFO L225 Difference]: With dead ends: 136 [2019-01-31 17:22:12,658 INFO L226 Difference]: Without dead ends: 91 [2019-01-31 17:22:12,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-31 17:22:12,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-31 17:22:12,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-31 17:22:12,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-31 17:22:12,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-01-31 17:22:12,661 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-01-31 17:22:12,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:12,661 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-01-31 17:22:12,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-31 17:22:12,662 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-01-31 17:22:12,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-31 17:22:12,662 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:12,662 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-01-31 17:22:12,663 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:12,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:12,663 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-01-31 17:22:12,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:12,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:12,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:12,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:12,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:13,472 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-31 17:22:13,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:13,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:13,472 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:13,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:13,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:13,473 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-31 17:22:13,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:13,483 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:22:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:13,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:13,559 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-31 17:22:13,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:15,613 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-31 17:22:15,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:15,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-31 17:22:15,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:15,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-31 17:22:15,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-31 17:22:15,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-31 17:22:15,643 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-01-31 17:22:15,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:15,893 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-01-31 17:22:15,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-31 17:22:15,893 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-01-31 17:22:15,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:15,894 INFO L225 Difference]: With dead ends: 139 [2019-01-31 17:22:15,894 INFO L226 Difference]: Without dead ends: 93 [2019-01-31 17:22:15,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-31 17:22:15,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-31 17:22:15,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-31 17:22:15,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-31 17:22:15,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-01-31 17:22:15,897 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-01-31 17:22:15,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:15,897 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-01-31 17:22:15,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-31 17:22:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-01-31 17:22:15,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-31 17:22:15,897 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:15,897 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-01-31 17:22:15,898 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:15,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:15,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-01-31 17:22:15,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:15,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:15,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:15,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:15,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:17,478 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-31 17:22:17,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:17,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:17,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:17,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:17,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:17,479 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-31 17:22:17,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:22:17,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:22:17,851 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-31 17:22:17,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:17,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:17,866 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-31 17:22:17,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:19,984 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-31 17:22:20,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:20,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-01-31 17:22:20,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:20,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-31 17:22:20,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-31 17:22:20,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-31 17:22:20,004 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-01-31 17:22:20,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:20,679 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-01-31 17:22:20,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-31 17:22:20,679 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-01-31 17:22:20,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:20,680 INFO L225 Difference]: With dead ends: 142 [2019-01-31 17:22:20,681 INFO L226 Difference]: Without dead ends: 95 [2019-01-31 17:22:20,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-31 17:22:20,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-31 17:22:20,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-31 17:22:20,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-31 17:22:20,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-01-31 17:22:20,683 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-01-31 17:22:20,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:20,683 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-01-31 17:22:20,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-31 17:22:20,684 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-01-31 17:22:20,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-31 17:22:20,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:20,684 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-01-31 17:22:20,684 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:20,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:20,684 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-01-31 17:22:20,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:20,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:20,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:20,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:20,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:21,702 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-31 17:22:21,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:21,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:21,703 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:21,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:21,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:21,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 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-31 17:22:21,722 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:22:21,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:22:21,792 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:22:21,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:21,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:21,810 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-31 17:22:21,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:24,827 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-31 17:22:24,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:24,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-31 17:22:24,846 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:24,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-31 17:22:24,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-31 17:22:24,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-31 17:22:24,847 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-01-31 17:22:25,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:25,114 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-01-31 17:22:25,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-31 17:22:25,117 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-01-31 17:22:25,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:25,118 INFO L225 Difference]: With dead ends: 145 [2019-01-31 17:22:25,118 INFO L226 Difference]: Without dead ends: 97 [2019-01-31 17:22:25,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-31 17:22:25,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-31 17:22:25,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-31 17:22:25,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-31 17:22:25,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-01-31 17:22:25,122 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-01-31 17:22:25,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:25,122 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-01-31 17:22:25,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-31 17:22:25,123 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-01-31 17:22:25,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-31 17:22:25,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:25,123 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-01-31 17:22:25,123 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:25,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:25,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-01-31 17:22:25,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:25,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:25,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:25,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:25,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:26,154 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-31 17:22:26,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:26,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:26,155 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:26,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:26,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:26,155 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-31 17:22:26,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:26,164 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:22:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:26,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:26,247 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-31 17:22:26,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:28,853 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-31 17:22:28,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:28,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-31 17:22:28,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:28,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-31 17:22:28,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-31 17:22:28,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-31 17:22:28,873 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-01-31 17:22:29,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:29,054 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-01-31 17:22:29,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-31 17:22:29,054 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-01-31 17:22:29,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:29,055 INFO L225 Difference]: With dead ends: 148 [2019-01-31 17:22:29,055 INFO L226 Difference]: Without dead ends: 99 [2019-01-31 17:22:29,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-31 17:22:29,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-31 17:22:29,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-31 17:22:29,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-31 17:22:29,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-01-31 17:22:29,059 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-01-31 17:22:29,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:29,059 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-01-31 17:22:29,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-31 17:22:29,060 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-01-31 17:22:29,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-31 17:22:29,060 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:29,060 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-01-31 17:22:29,061 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:29,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:29,061 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-01-31 17:22:29,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:29,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:29,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:29,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:29,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:30,353 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-31 17:22:30,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:30,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:30,353 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:30,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:30,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:30,354 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-31 17:22:30,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:22:30,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:22:30,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-31 17:22:30,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:30,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:30,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-31 17:22:30,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:33,633 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-31 17:22:33,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:33,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-31 17:22:33,653 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:33,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-31 17:22:33,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-31 17:22:33,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-31 17:22:33,655 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-01-31 17:22:33,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:33,842 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-01-31 17:22:33,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-31 17:22:33,842 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-01-31 17:22:33,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:33,843 INFO L225 Difference]: With dead ends: 151 [2019-01-31 17:22:33,843 INFO L226 Difference]: Without dead ends: 101 [2019-01-31 17:22:33,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-31 17:22:33,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-31 17:22:33,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-31 17:22:33,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-31 17:22:33,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-01-31 17:22:33,847 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-01-31 17:22:33,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:33,847 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-01-31 17:22:33,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-31 17:22:33,847 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-01-31 17:22:33,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-31 17:22:33,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:33,848 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-01-31 17:22:33,848 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:33,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:33,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-01-31 17:22:33,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:33,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:33,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:33,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:33,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:35,029 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-31 17:22:35,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:35,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:35,030 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:35,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:35,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:35,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:22:35,038 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:22:35,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:22:35,104 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:22:35,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:35,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:35,119 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-31 17:22:35,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:37,839 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-31 17:22:37,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:37,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-31 17:22:37,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:37,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-31 17:22:37,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-31 17:22:37,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-31 17:22:37,859 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-01-31 17:22:38,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:38,169 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-01-31 17:22:38,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-31 17:22:38,169 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-01-31 17:22:38,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:38,170 INFO L225 Difference]: With dead ends: 154 [2019-01-31 17:22:38,170 INFO L226 Difference]: Without dead ends: 103 [2019-01-31 17:22:38,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-31 17:22:38,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-31 17:22:38,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-31 17:22:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-31 17:22:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-01-31 17:22:38,173 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-01-31 17:22:38,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:38,174 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-01-31 17:22:38,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-31 17:22:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-01-31 17:22:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-31 17:22:38,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:38,174 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-01-31 17:22:38,174 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:38,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:38,175 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-01-31 17:22:38,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:38,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:38,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:38,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:38,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:39,281 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-31 17:22:39,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:39,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:39,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:39,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:39,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:39,282 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-31 17:22:39,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:39,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:22:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:39,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:39,379 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-31 17:22:39,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:42,015 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-31 17:22:42,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:42,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-31 17:22:42,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:42,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-31 17:22:42,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-31 17:22:42,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-31 17:22:42,035 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-01-31 17:22:42,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:42,313 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-01-31 17:22:42,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-31 17:22:42,313 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-01-31 17:22:42,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:42,314 INFO L225 Difference]: With dead ends: 157 [2019-01-31 17:22:42,314 INFO L226 Difference]: Without dead ends: 105 [2019-01-31 17:22:42,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-31 17:22:42,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-31 17:22:42,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-31 17:22:42,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-31 17:22:42,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-01-31 17:22:42,319 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-01-31 17:22:42,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:42,319 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-01-31 17:22:42,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-31 17:22:42,319 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-01-31 17:22:42,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-31 17:22:42,320 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:42,320 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-01-31 17:22:42,320 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:42,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:42,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-01-31 17:22:42,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:42,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:42,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:42,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:42,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:43,574 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-31 17:22:43,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:43,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:43,575 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:43,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:43,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:43,575 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-31 17:22:43,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:22:43,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:22:44,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-31 17:22:44,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:44,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:44,786 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-31 17:22:44,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:47,632 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-31 17:22:47,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:47,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-31 17:22:47,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:47,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-31 17:22:47,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-31 17:22:47,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-31 17:22:47,654 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-01-31 17:22:48,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:48,450 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-01-31 17:22:48,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-31 17:22:48,450 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-01-31 17:22:48,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:48,451 INFO L225 Difference]: With dead ends: 160 [2019-01-31 17:22:48,451 INFO L226 Difference]: Without dead ends: 107 [2019-01-31 17:22:48,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-31 17:22:48,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-31 17:22:48,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-31 17:22:48,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-31 17:22:48,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-01-31 17:22:48,455 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-01-31 17:22:48,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:48,456 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-01-31 17:22:48,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-31 17:22:48,456 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-01-31 17:22:48,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-31 17:22:48,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:48,457 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-01-31 17:22:48,457 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:48,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:48,457 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-01-31 17:22:48,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:48,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:48,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:48,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:48,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:49,550 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-31 17:22:49,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:49,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:49,551 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:49,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:49,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:49,551 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-31 17:22:49,561 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:22:49,561 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:22:49,636 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:22:49,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:49,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:49,653 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-31 17:22:49,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:52,420 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-31 17:22:52,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:52,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-31 17:22:52,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:52,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-31 17:22:52,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-31 17:22:52,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-31 17:22:52,443 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-01-31 17:22:52,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:52,766 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-01-31 17:22:52,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-31 17:22:52,766 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-01-31 17:22:52,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:52,767 INFO L225 Difference]: With dead ends: 163 [2019-01-31 17:22:52,767 INFO L226 Difference]: Without dead ends: 109 [2019-01-31 17:22:52,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-31 17:22:52,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-31 17:22:52,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-31 17:22:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-31 17:22:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-01-31 17:22:52,772 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-01-31 17:22:52,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:52,772 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-01-31 17:22:52,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-31 17:22:52,773 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-01-31 17:22:52,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-31 17:22:52,773 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:52,773 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-01-31 17:22:52,773 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:52,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:52,774 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-01-31 17:22:52,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:52,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:52,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:52,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:52,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:54,217 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-31 17:22:54,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:54,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:54,217 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:54,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:54,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:54,218 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-31 17:22:54,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:54,225 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:22:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:54,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:54,318 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-31 17:22:54,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:57,201 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-31 17:22:57,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:57,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-31 17:22:57,220 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:57,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-31 17:22:57,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-31 17:22:57,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-31 17:22:57,221 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-01-31 17:22:57,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:57,459 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-01-31 17:22:57,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-31 17:22:57,459 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-01-31 17:22:57,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:57,460 INFO L225 Difference]: With dead ends: 166 [2019-01-31 17:22:57,460 INFO L226 Difference]: Without dead ends: 111 [2019-01-31 17:22:57,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-31 17:22:57,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-31 17:22:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-31 17:22:57,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-31 17:22:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-01-31 17:22:57,463 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-01-31 17:22:57,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:57,463 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-01-31 17:22:57,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-31 17:22:57,463 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-01-31 17:22:57,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-31 17:22:57,464 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:57,464 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-01-31 17:22:57,464 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:57,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:57,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-01-31 17:22:57,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:57,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:57,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:57,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:57,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:58,881 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-31 17:22:58,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:58,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:58,882 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:58,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:58,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:58,882 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-31 17:22:58,890 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:22:58,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:23:00,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-31 17:23:00,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:00,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:00,065 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-31 17:23:00,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:03,460 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-31 17:23:03,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:03,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-01-31 17:23:03,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:03,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-31 17:23:03,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-31 17:23:03,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-31 17:23:03,482 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2019-01-31 17:23:03,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:03,756 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2019-01-31 17:23:03,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-31 17:23:03,756 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-01-31 17:23:03,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:03,757 INFO L225 Difference]: With dead ends: 169 [2019-01-31 17:23:03,757 INFO L226 Difference]: Without dead ends: 113 [2019-01-31 17:23:03,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-31 17:23:03,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-31 17:23:03,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-31 17:23:03,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-31 17:23:03,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-01-31 17:23:03,760 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2019-01-31 17:23:03,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:03,760 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-01-31 17:23:03,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-31 17:23:03,760 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-01-31 17:23:03,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-31 17:23:03,761 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:03,761 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2019-01-31 17:23:03,761 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:03,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:03,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2019-01-31 17:23:03,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:03,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:03,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:23:03,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:03,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:04,938 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-31 17:23:04,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:04,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:04,939 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:04,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:04,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:04,939 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-31 17:23:04,948 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:23:04,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:23:05,027 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:23:05,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:05,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:05,042 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-31 17:23:05,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:08,413 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-31 17:23:08,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:08,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-01-31 17:23:08,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:08,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-31 17:23:08,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-31 17:23:08,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-31 17:23:08,433 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2019-01-31 17:23:08,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:08,666 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2019-01-31 17:23:08,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-31 17:23:08,666 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-01-31 17:23:08,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:08,667 INFO L225 Difference]: With dead ends: 172 [2019-01-31 17:23:08,667 INFO L226 Difference]: Without dead ends: 115 [2019-01-31 17:23:08,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-31 17:23:08,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-31 17:23:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-01-31 17:23:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-31 17:23:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-01-31 17:23:08,671 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2019-01-31 17:23:08,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:08,671 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-01-31 17:23:08,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-31 17:23:08,672 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-01-31 17:23:08,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-31 17:23:08,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:08,672 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2019-01-31 17:23:08,672 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:08,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:08,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2019-01-31 17:23:08,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:08,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:08,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:23:08,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:08,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:09,877 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-31 17:23:09,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:09,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:09,878 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:09,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:09,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:09,878 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-31 17:23:09,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:23:09,887 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:23:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:09,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:09,990 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-31 17:23:09,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:13,614 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-31 17:23:13,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:13,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-01-31 17:23:13,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:13,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-31 17:23:13,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-31 17:23:13,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-31 17:23:13,635 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2019-01-31 17:23:14,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:14,015 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2019-01-31 17:23:14,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-31 17:23:14,016 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2019-01-31 17:23:14,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:14,016 INFO L225 Difference]: With dead ends: 175 [2019-01-31 17:23:14,016 INFO L226 Difference]: Without dead ends: 117 [2019-01-31 17:23:14,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-31 17:23:14,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-31 17:23:14,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-01-31 17:23:14,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-31 17:23:14,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-01-31 17:23:14,019 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-01-31 17:23:14,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:14,019 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-01-31 17:23:14,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-31 17:23:14,020 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-01-31 17:23:14,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-31 17:23:14,020 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:14,020 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2019-01-31 17:23:14,021 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:14,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:14,021 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2019-01-31 17:23:14,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:14,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:14,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:23:14,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:14,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:15,366 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-31 17:23:15,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:15,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:15,366 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:15,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:15,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:15,367 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-31 17:23:15,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:23:15,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:23:16,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-31 17:23:16,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:16,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:16,213 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-31 17:23:16,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:20,114 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-31 17:23:20,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:20,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-01-31 17:23:20,135 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:20,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-31 17:23:20,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-31 17:23:20,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-31 17:23:20,136 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2019-01-31 17:23:20,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:20,455 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2019-01-31 17:23:20,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-31 17:23:20,456 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2019-01-31 17:23:20,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:20,456 INFO L225 Difference]: With dead ends: 178 [2019-01-31 17:23:20,456 INFO L226 Difference]: Without dead ends: 119 [2019-01-31 17:23:20,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-31 17:23:20,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-31 17:23:20,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-01-31 17:23:20,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-31 17:23:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-01-31 17:23:20,459 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2019-01-31 17:23:20,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:20,459 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-01-31 17:23:20,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-31 17:23:20,460 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-01-31 17:23:20,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-31 17:23:20,460 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:20,460 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2019-01-31 17:23:20,461 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:20,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:20,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2019-01-31 17:23:20,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:20,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:20,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:23:20,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:20,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:21,692 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-31 17:23:21,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:21,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:21,693 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:21,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:21,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:21,693 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-31 17:23:21,702 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:23:21,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:23:21,781 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:23:21,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:21,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:21,819 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-31 17:23:21,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:25,692 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-31 17:23:25,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:25,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-01-31 17:23:25,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:25,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-31 17:23:25,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-31 17:23:25,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-31 17:23:25,712 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2019-01-31 17:23:26,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:26,018 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2019-01-31 17:23:26,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-31 17:23:26,018 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2019-01-31 17:23:26,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:26,019 INFO L225 Difference]: With dead ends: 181 [2019-01-31 17:23:26,019 INFO L226 Difference]: Without dead ends: 121 [2019-01-31 17:23:26,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-31 17:23:26,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-31 17:23:26,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-01-31 17:23:26,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-31 17:23:26,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-01-31 17:23:26,023 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2019-01-31 17:23:26,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:26,023 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-01-31 17:23:26,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-31 17:23:26,023 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-01-31 17:23:26,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-31 17:23:26,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:26,024 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2019-01-31 17:23:26,024 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:26,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:26,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2019-01-31 17:23:26,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:26,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:26,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:23:26,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:26,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:27,291 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-31 17:23:27,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:27,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:27,292 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:27,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:27,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:27,292 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-31 17:23:27,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:23:27,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:23:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:27,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:27,400 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-31 17:23:27,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:31,195 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-31 17:23:31,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:31,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-01-31 17:23:31,214 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:31,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-31 17:23:31,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-31 17:23:31,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-31 17:23:31,215 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2019-01-31 17:23:31,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:31,580 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2019-01-31 17:23:31,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-31 17:23:31,580 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-01-31 17:23:31,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:31,581 INFO L225 Difference]: With dead ends: 184 [2019-01-31 17:23:31,581 INFO L226 Difference]: Without dead ends: 123 [2019-01-31 17:23:31,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-31 17:23:31,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-31 17:23:31,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-01-31 17:23:31,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-31 17:23:31,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-01-31 17:23:31,585 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-01-31 17:23:31,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:31,585 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-01-31 17:23:31,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-31 17:23:31,585 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-01-31 17:23:31,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-31 17:23:31,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:31,586 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2019-01-31 17:23:31,586 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:31,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:31,587 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2019-01-31 17:23:31,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:31,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:31,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:23:31,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:31,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:32,902 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-31 17:23:32,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:32,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:32,903 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:32,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:32,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:32,903 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-31 17:23:32,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:23:32,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:23:33,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-01-31 17:23:33,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:33,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:33,962 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-31 17:23:33,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:37,573 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-31 17:23:37,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:37,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-01-31 17:23:37,595 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:37,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-31 17:23:37,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-31 17:23:37,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-31 17:23:37,597 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2019-01-31 17:23:37,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:37,941 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2019-01-31 17:23:37,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-31 17:23:37,942 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2019-01-31 17:23:37,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:37,942 INFO L225 Difference]: With dead ends: 187 [2019-01-31 17:23:37,943 INFO L226 Difference]: Without dead ends: 125 [2019-01-31 17:23:37,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-31 17:23:37,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-31 17:23:37,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-01-31 17:23:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-31 17:23:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-01-31 17:23:37,947 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2019-01-31 17:23:37,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:37,947 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-01-31 17:23:37,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-31 17:23:37,947 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-01-31 17:23:37,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-01-31 17:23:37,948 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:37,948 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2019-01-31 17:23:37,948 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:37,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:37,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2019-01-31 17:23:37,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:37,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:37,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:23:37,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:37,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:39,800 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-31 17:23:39,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:39,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:39,800 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:39,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:39,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:39,800 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-31 17:23:39,810 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:23:39,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:23:39,895 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:23:39,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:39,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:39,915 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-31 17:23:39,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:43,735 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-31 17:23:43,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:43,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-01-31 17:23:43,755 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:43,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-31 17:23:43,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-31 17:23:43,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-31 17:23:43,757 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2019-01-31 17:23:44,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:44,106 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2019-01-31 17:23:44,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-31 17:23:44,106 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2019-01-31 17:23:44,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:44,107 INFO L225 Difference]: With dead ends: 190 [2019-01-31 17:23:44,108 INFO L226 Difference]: Without dead ends: 127 [2019-01-31 17:23:44,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-31 17:23:44,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-31 17:23:44,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-01-31 17:23:44,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-31 17:23:44,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-01-31 17:23:44,111 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2019-01-31 17:23:44,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:44,111 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-01-31 17:23:44,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-31 17:23:44,112 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-01-31 17:23:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-31 17:23:44,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:44,112 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2019-01-31 17:23:44,112 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:44,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:44,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2019-01-31 17:23:44,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:44,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:44,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:23:44,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:44,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:45,525 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-31 17:23:45,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:45,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:45,525 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:45,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:45,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:45,525 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-31 17:23:45,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:23:45,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:23:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:45,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:45,637 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-31 17:23:45,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:49,882 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-31 17:23:49,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:49,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-01-31 17:23:49,901 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:49,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-31 17:23:49,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-31 17:23:49,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-31 17:23:49,902 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2019-01-31 17:23:50,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:50,277 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2019-01-31 17:23:50,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-31 17:23:50,278 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2019-01-31 17:23:50,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:50,278 INFO L225 Difference]: With dead ends: 193 [2019-01-31 17:23:50,278 INFO L226 Difference]: Without dead ends: 129 [2019-01-31 17:23:50,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-31 17:23:50,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-31 17:23:50,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-01-31 17:23:50,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-31 17:23:50,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-01-31 17:23:50,282 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-01-31 17:23:50,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:50,282 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-01-31 17:23:50,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-31 17:23:50,282 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-01-31 17:23:50,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-31 17:23:50,283 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:50,283 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2019-01-31 17:23:50,283 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:50,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:50,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2019-01-31 17:23:50,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:50,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:50,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:23:50,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:50,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:51,755 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-31 17:23:51,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:51,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:51,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:51,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:51,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:51,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 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-31 17:23:51,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:23:51,765 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:23:52,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-31 17:23:52,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:52,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:52,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-31 17:23:52,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:57,167 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-31 17:23:57,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:57,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-01-31 17:23:57,188 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:57,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-31 17:23:57,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-31 17:23:57,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-31 17:23:57,190 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2019-01-31 17:23:57,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:57,582 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2019-01-31 17:23:57,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-31 17:23:57,582 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-01-31 17:23:57,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:57,583 INFO L225 Difference]: With dead ends: 196 [2019-01-31 17:23:57,583 INFO L226 Difference]: Without dead ends: 131 [2019-01-31 17:23:57,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-31 17:23:57,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-31 17:23:57,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-01-31 17:23:57,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-31 17:23:57,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-01-31 17:23:57,587 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2019-01-31 17:23:57,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:57,587 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-01-31 17:23:57,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-31 17:23:57,587 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-01-31 17:23:57,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-31 17:23:57,587 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:57,588 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2019-01-31 17:23:57,588 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:57,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:57,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2019-01-31 17:23:57,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:57,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:57,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:23:57,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:57,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:59,336 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-31 17:23:59,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:59,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:59,337 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:59,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:59,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:59,337 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-31 17:23:59,350 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:23:59,350 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:23:59,438 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:23:59,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:59,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:59,457 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-31 17:23:59,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:03,649 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-31 17:24:03,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:03,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-01-31 17:24:03,669 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:03,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-31 17:24:03,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-31 17:24:03,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-31 17:24:03,671 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2019-01-31 17:24:04,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:04,082 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2019-01-31 17:24:04,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-31 17:24:04,082 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2019-01-31 17:24:04,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:04,083 INFO L225 Difference]: With dead ends: 199 [2019-01-31 17:24:04,083 INFO L226 Difference]: Without dead ends: 133 [2019-01-31 17:24:04,083 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-31 17:24:04,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-31 17:24:04,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-01-31 17:24:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-31 17:24:04,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-01-31 17:24:04,086 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2019-01-31 17:24:04,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:04,086 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-01-31 17:24:04,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-31 17:24:04,086 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-01-31 17:24:04,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-31 17:24:04,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:04,087 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2019-01-31 17:24:04,087 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:04,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:04,088 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2019-01-31 17:24:04,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:04,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:04,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:24:04,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:04,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:05,926 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-31 17:24:05,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:05,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:05,927 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:05,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:05,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:05,927 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-31 17:24:05,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:24:05,935 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:24:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:06,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:06,043 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-31 17:24:06,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:10,612 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-31 17:24:10,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:10,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-01-31 17:24:10,630 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:10,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-31 17:24:10,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-31 17:24:10,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-31 17:24:10,632 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2019-01-31 17:24:11,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:11,086 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2019-01-31 17:24:11,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-31 17:24:11,086 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2019-01-31 17:24:11,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:11,087 INFO L225 Difference]: With dead ends: 202 [2019-01-31 17:24:11,087 INFO L226 Difference]: Without dead ends: 135 [2019-01-31 17:24:11,088 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-31 17:24:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-31 17:24:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-01-31 17:24:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-01-31 17:24:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-01-31 17:24:11,092 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-01-31 17:24:11,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:11,092 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-01-31 17:24:11,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-31 17:24:11,092 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-01-31 17:24:11,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-01-31 17:24:11,093 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:11,093 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2019-01-31 17:24:11,093 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:11,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:11,093 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2019-01-31 17:24:11,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:11,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:11,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:24:11,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:11,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:12,665 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-31 17:24:12,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:12,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:12,665 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:12,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:12,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:12,666 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-31 17:24:12,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:24:12,674 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:24:15,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-31 17:24:15,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:24:15,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:15,720 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-31 17:24:15,721 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:21,901 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-31 17:24:21,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:21,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-01-31 17:24:21,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:21,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-31 17:24:21,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-31 17:24:21,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-31 17:24:21,926 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2019-01-31 17:24:22,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:22,300 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2019-01-31 17:24:22,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-31 17:24:22,300 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2019-01-31 17:24:22,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:22,301 INFO L225 Difference]: With dead ends: 205 [2019-01-31 17:24:22,301 INFO L226 Difference]: Without dead ends: 137 [2019-01-31 17:24:22,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-31 17:24:22,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-31 17:24:22,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-01-31 17:24:22,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-31 17:24:22,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-01-31 17:24:22,306 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2019-01-31 17:24:22,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:22,306 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-01-31 17:24:22,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-31 17:24:22,307 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-01-31 17:24:22,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-31 17:24:22,307 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:22,307 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2019-01-31 17:24:22,308 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:22,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:22,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2019-01-31 17:24:22,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:22,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:22,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:24:22,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:22,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:23,982 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-31 17:24:23,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:23,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:23,983 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:23,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:23,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:23,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 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-31 17:24:23,993 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:24:23,994 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:24:24,083 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:24:24,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:24:24,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:24,112 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-31 17:24:24,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:29,018 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-31 17:24:29,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:29,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-01-31 17:24:29,038 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:29,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-31 17:24:29,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-31 17:24:29,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-31 17:24:29,039 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2019-01-31 17:24:29,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:29,538 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2019-01-31 17:24:29,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-31 17:24:29,539 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-01-31 17:24:29,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:29,539 INFO L225 Difference]: With dead ends: 208 [2019-01-31 17:24:29,539 INFO L226 Difference]: Without dead ends: 139 [2019-01-31 17:24:29,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-31 17:24:29,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-31 17:24:29,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-01-31 17:24:29,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-01-31 17:24:29,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-01-31 17:24:29,543 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2019-01-31 17:24:29,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:29,543 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-01-31 17:24:29,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-31 17:24:29,544 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-01-31 17:24:29,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-01-31 17:24:29,544 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:29,545 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2019-01-31 17:24:29,545 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:29,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:29,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2019-01-31 17:24:29,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:29,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:29,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:24:29,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:29,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:31,506 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-31 17:24:31,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:31,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:31,506 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:31,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:31,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:31,506 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-31 17:24:31,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:24:31,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:24:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:31,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:31,627 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-31 17:24:31,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:36,697 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-31 17:24:36,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:36,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-01-31 17:24:36,717 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:36,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-31 17:24:36,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-31 17:24:36,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-31 17:24:36,718 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2019-01-31 17:24:37,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:37,205 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2019-01-31 17:24:37,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-31 17:24:37,205 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2019-01-31 17:24:37,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:37,206 INFO L225 Difference]: With dead ends: 211 [2019-01-31 17:24:37,206 INFO L226 Difference]: Without dead ends: 141 [2019-01-31 17:24:37,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-31 17:24:37,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-31 17:24:37,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-01-31 17:24:37,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-31 17:24:37,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-01-31 17:24:37,210 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-01-31 17:24:37,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:37,210 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-01-31 17:24:37,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-31 17:24:37,210 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-01-31 17:24:37,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-31 17:24:37,211 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:37,211 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2019-01-31 17:24:37,211 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:37,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:37,211 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2019-01-31 17:24:37,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:37,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:37,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:24:37,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:37,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:38,930 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-31 17:24:38,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:38,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:38,930 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:38,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:38,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:38,931 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-31 17:24:38,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:24:38,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:24:42,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-31 17:24:42,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:24:42,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:42,292 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-31 17:24:42,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:47,385 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-31 17:24:47,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:47,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-01-31 17:24:47,408 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:47,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-31 17:24:47,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-31 17:24:47,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-31 17:24:47,409 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2019-01-31 17:24:47,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:47,931 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2019-01-31 17:24:47,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-31 17:24:47,931 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2019-01-31 17:24:47,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:47,932 INFO L225 Difference]: With dead ends: 214 [2019-01-31 17:24:47,932 INFO L226 Difference]: Without dead ends: 143 [2019-01-31 17:24:47,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-31 17:24:47,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-01-31 17:24:47,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-01-31 17:24:47,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-31 17:24:47,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-01-31 17:24:47,935 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2019-01-31 17:24:47,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:47,935 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-01-31 17:24:47,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-31 17:24:47,936 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-01-31 17:24:47,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-31 17:24:47,936 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:47,936 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2019-01-31 17:24:47,936 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:47,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:47,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2019-01-31 17:24:47,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:47,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:47,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:24:47,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:47,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:49,699 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-31 17:24:49,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:49,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:49,699 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:49,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:49,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:49,700 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-31 17:24:49,708 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:24:49,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:24:49,805 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:24:49,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:24:49,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:49,826 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-31 17:24:49,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:54,915 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-31 17:24:54,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:54,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-01-31 17:24:54,934 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:54,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-31 17:24:54,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-31 17:24:54,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-31 17:24:54,937 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2019-01-31 17:24:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:55,476 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2019-01-31 17:24:55,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-31 17:24:55,477 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2019-01-31 17:24:55,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:55,477 INFO L225 Difference]: With dead ends: 217 [2019-01-31 17:24:55,477 INFO L226 Difference]: Without dead ends: 145 [2019-01-31 17:24:55,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-31 17:24:55,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-31 17:24:55,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-01-31 17:24:55,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-31 17:24:55,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-01-31 17:24:55,481 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2019-01-31 17:24:55,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:55,481 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-01-31 17:24:55,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-31 17:24:55,481 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-01-31 17:24:55,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-01-31 17:24:55,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:55,482 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2019-01-31 17:24:55,482 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:55,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:55,482 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2019-01-31 17:24:55,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:55,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:55,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:24:55,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:55,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:57,390 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-31 17:24:57,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:57,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:57,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:57,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:57,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:57,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:24:57,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:24:57,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:24:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:57,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:57,533 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-31 17:24:57,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:25:03,061 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-31 17:25:03,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:25:03,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-01-31 17:25:03,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:25:03,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-31 17:25:03,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-31 17:25:03,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-31 17:25:03,081 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2019-01-31 17:25:03,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:25:03,489 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2019-01-31 17:25:03,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-31 17:25:03,490 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-01-31 17:25:03,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:25:03,491 INFO L225 Difference]: With dead ends: 220 [2019-01-31 17:25:03,491 INFO L226 Difference]: Without dead ends: 147 [2019-01-31 17:25:03,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-31 17:25:03,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-01-31 17:25:03,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-01-31 17:25:03,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-31 17:25:03,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-01-31 17:25:03,497 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-01-31 17:25:03,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:25:03,497 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-01-31 17:25:03,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-31 17:25:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-01-31 17:25:03,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-31 17:25:03,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:25:03,498 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2019-01-31 17:25:03,498 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:25:03,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:25:03,499 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2019-01-31 17:25:03,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:25:03,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:03,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:25:03,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:03,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:25:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:05,378 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-31 17:25:05,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:05,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:25:05,379 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:25:05,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:25:05,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:05,379 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-31 17:25:05,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:25:05,387 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:25:08,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-01-31 17:25:08,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:25:08,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:25:08,115 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-31 17:25:08,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:25:13,619 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-31 17:25:13,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:25:13,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-01-31 17:25:13,644 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:25:13,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-31 17:25:13,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-31 17:25:13,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-31 17:25:13,646 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2019-01-31 17:25:14,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:25:14,249 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2019-01-31 17:25:14,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-31 17:25:14,250 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2019-01-31 17:25:14,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:25:14,250 INFO L225 Difference]: With dead ends: 223 [2019-01-31 17:25:14,250 INFO L226 Difference]: Without dead ends: 149 [2019-01-31 17:25:14,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-31 17:25:14,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-31 17:25:14,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-01-31 17:25:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-31 17:25:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-01-31 17:25:14,255 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2019-01-31 17:25:14,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:25:14,256 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-01-31 17:25:14,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-31 17:25:14,256 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-01-31 17:25:14,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-01-31 17:25:14,257 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:25:14,257 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2019-01-31 17:25:14,257 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:25:14,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:25:14,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2019-01-31 17:25:14,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:25:14,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:14,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:25:14,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:14,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:25:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:16,507 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-31 17:25:16,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:16,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:25:16,508 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:25:16,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:25:16,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:16,508 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-31 17:25:16,516 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:25:16,516 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:25:16,612 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:25:16,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:25:16,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:25:16,638 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-31 17:25:16,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:25:22,385 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-31 17:25:22,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:25:22,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-01-31 17:25:22,404 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:25:22,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-31 17:25:22,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-31 17:25:22,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-31 17:25:22,405 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2019-01-31 17:25:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:25:22,945 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2019-01-31 17:25:22,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-31 17:25:22,946 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2019-01-31 17:25:22,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:25:22,946 INFO L225 Difference]: With dead ends: 226 [2019-01-31 17:25:22,947 INFO L226 Difference]: Without dead ends: 151 [2019-01-31 17:25:22,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-31 17:25:22,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-31 17:25:22,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-01-31 17:25:22,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-31 17:25:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-01-31 17:25:22,952 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2019-01-31 17:25:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:25:22,953 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-01-31 17:25:22,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-31 17:25:22,953 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-01-31 17:25:22,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-31 17:25:22,954 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:25:22,954 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2019-01-31 17:25:22,954 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:25:22,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:25:22,955 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2019-01-31 17:25:22,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:25:22,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:22,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:25:22,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:22,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:25:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:25,017 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-31 17:25:25,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:25,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:25:25,018 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:25:25,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:25:25,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:25,018 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-31 17:25:25,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:25:25,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:25:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:25,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:25:25,157 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-31 17:25:25,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:25:30,898 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-31 17:25:30,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:25:30,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-01-31 17:25:30,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:25:30,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-31 17:25:30,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-31 17:25:30,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-31 17:25:30,920 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2019-01-31 17:25:31,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:25:31,457 INFO L93 Difference]: Finished difference Result 229 states and 232 transitions. [2019-01-31 17:25:31,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-31 17:25:31,457 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2019-01-31 17:25:31,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:25:31,458 INFO L225 Difference]: With dead ends: 229 [2019-01-31 17:25:31,458 INFO L226 Difference]: Without dead ends: 153 [2019-01-31 17:25:31,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-31 17:25:31,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-31 17:25:31,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-01-31 17:25:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-31 17:25:31,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-01-31 17:25:31,463 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-01-31 17:25:31,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:25:31,463 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-01-31 17:25:31,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-31 17:25:31,464 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-01-31 17:25:31,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-01-31 17:25:31,464 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:25:31,464 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2019-01-31 17:25:31,465 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:25:31,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:25:31,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2019-01-31 17:25:31,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:25:31,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:31,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:25:31,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:31,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:25:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:33,527 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-31 17:25:33,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:33,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:25:33,528 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:25:33,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:25:33,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:33,528 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-31 17:25:33,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:25:33,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:25:35,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-31 17:25:35,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:25:35,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:25:35,806 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-31 17:25:35,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:25:42,047 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-31 17:25:42,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:25:42,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-01-31 17:25:42,070 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:25:42,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-31 17:25:42,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-31 17:25:42,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-31 17:25:42,071 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2019-01-31 17:25:42,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:25:42,672 INFO L93 Difference]: Finished difference Result 232 states and 235 transitions. [2019-01-31 17:25:42,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-31 17:25:42,672 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2019-01-31 17:25:42,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:25:42,673 INFO L225 Difference]: With dead ends: 232 [2019-01-31 17:25:42,673 INFO L226 Difference]: Without dead ends: 155 [2019-01-31 17:25:42,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-31 17:25:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-31 17:25:42,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-01-31 17:25:42,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-01-31 17:25:42,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-01-31 17:25:42,677 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2019-01-31 17:25:42,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:25:42,677 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-01-31 17:25:42,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-31 17:25:42,677 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-01-31 17:25:42,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-01-31 17:25:42,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:25:42,678 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2019-01-31 17:25:42,678 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:25:42,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:25:42,678 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2019-01-31 17:25:42,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:25:42,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:42,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:25:42,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:42,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:25:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:44,810 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-31 17:25:44,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:44,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:25:44,810 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:25:44,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:25:44,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:44,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 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-31 17:25:44,819 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:25:44,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:25:44,920 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:25:44,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:25:44,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:25:44,954 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-31 17:25:44,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:25:50,971 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-31 17:25:50,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:25:50,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-01-31 17:25:50,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:25:50,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-31 17:25:50,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-31 17:25:50,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-31 17:25:50,991 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2019-01-31 17:25:51,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:25:51,727 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2019-01-31 17:25:51,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-31 17:25:51,727 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2019-01-31 17:25:51,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:25:51,728 INFO L225 Difference]: With dead ends: 235 [2019-01-31 17:25:51,728 INFO L226 Difference]: Without dead ends: 157 [2019-01-31 17:25:51,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-31 17:25:51,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-01-31 17:25:51,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-01-31 17:25:51,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-31 17:25:51,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-01-31 17:25:51,731 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2019-01-31 17:25:51,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:25:51,731 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-01-31 17:25:51,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-31 17:25:51,732 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-01-31 17:25:51,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-31 17:25:51,732 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:25:51,732 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2019-01-31 17:25:51,732 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:25:51,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:25:51,733 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2019-01-31 17:25:51,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:25:51,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:51,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:25:51,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:51,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:25:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:53,996 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-31 17:25:53,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:53,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:25:53,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:25:53,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:25:53,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:53,997 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-31 17:25:54,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:25:54,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:25:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:54,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:25:54,131 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-31 17:25:54,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:26:00,408 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-31 17:26:00,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:26:00,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-01-31 17:26:00,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:26:00,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-31 17:26:00,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-31 17:26:00,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-31 17:26:00,428 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2019-01-31 17:26:01,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:26:01,025 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2019-01-31 17:26:01,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-31 17:26:01,025 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2019-01-31 17:26:01,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:26:01,026 INFO L225 Difference]: With dead ends: 238 [2019-01-31 17:26:01,026 INFO L226 Difference]: Without dead ends: 159 [2019-01-31 17:26:01,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-31 17:26:01,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-31 17:26:01,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-01-31 17:26:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-01-31 17:26:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-01-31 17:26:01,031 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-01-31 17:26:01,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:26:01,031 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-01-31 17:26:01,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-31 17:26:01,031 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-01-31 17:26:01,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-31 17:26:01,032 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:26:01,032 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2019-01-31 17:26:01,032 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:26:01,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:26:01,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2019-01-31 17:26:01,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:26:01,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:01,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:26:01,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:01,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:26:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:26:03,434 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-31 17:26:03,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:03,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:26:03,435 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:26:03,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:26:03,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:03,435 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-31 17:26:03,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:26:03,444 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:26:08,023 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-31 17:26:08,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:26:08,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:26:08,064 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-31 17:26:08,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:26:14,616 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-31 17:26:14,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:26:14,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-01-31 17:26:14,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:26:14,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-31 17:26:14,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-31 17:26:14,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-31 17:26:14,643 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2019-01-31 17:26:15,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:26:15,391 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2019-01-31 17:26:15,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-31 17:26:15,391 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2019-01-31 17:26:15,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:26:15,392 INFO L225 Difference]: With dead ends: 241 [2019-01-31 17:26:15,392 INFO L226 Difference]: Without dead ends: 161 [2019-01-31 17:26:15,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-31 17:26:15,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-01-31 17:26:15,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-01-31 17:26:15,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-31 17:26:15,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-01-31 17:26:15,398 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2019-01-31 17:26:15,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:26:15,398 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-01-31 17:26:15,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-31 17:26:15,398 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-01-31 17:26:15,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-31 17:26:15,399 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:26:15,399 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2019-01-31 17:26:15,399 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:26:15,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:26:15,400 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2019-01-31 17:26:15,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:26:15,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:15,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:26:15,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:15,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:26:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:26:17,868 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-31 17:26:17,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:17,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:26:17,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:26:17,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:26:17,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:17,869 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-31 17:26:17,878 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:26:17,878 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:26:17,984 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:26:17,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:26:17,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:26:18,009 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-31 17:26:18,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:26:24,408 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-31 17:26:24,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:26:24,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-01-31 17:26:24,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:26:24,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-31 17:26:24,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-31 17:26:24,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-31 17:26:24,429 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2019-01-31 17:26:25,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:26:25,222 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2019-01-31 17:26:25,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-31 17:26:25,223 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2019-01-31 17:26:25,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:26:25,223 INFO L225 Difference]: With dead ends: 244 [2019-01-31 17:26:25,223 INFO L226 Difference]: Without dead ends: 163 [2019-01-31 17:26:25,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-31 17:26:25,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-31 17:26:25,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-01-31 17:26:25,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-01-31 17:26:25,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-01-31 17:26:25,229 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2019-01-31 17:26:25,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:26:25,229 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-01-31 17:26:25,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-31 17:26:25,230 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-01-31 17:26:25,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-01-31 17:26:25,230 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:26:25,230 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2019-01-31 17:26:25,231 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:26:25,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:26:25,231 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2019-01-31 17:26:25,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:26:25,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:25,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:26:25,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:25,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:26:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:26:27,916 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-31 17:26:27,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:27,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:26:27,916 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:26:27,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:26:27,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:27,916 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-31 17:26:27,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:26:27,924 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:26:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:26:28,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:26:28,066 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-31 17:26:28,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:26:34,928 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-31 17:26:34,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:26:34,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-01-31 17:26:34,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:26:34,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-31 17:26:34,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-31 17:26:34,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-31 17:26:34,950 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2019-01-31 17:26:35,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:26:35,777 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2019-01-31 17:26:35,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-31 17:26:35,777 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2019-01-31 17:26:35,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:26:35,778 INFO L225 Difference]: With dead ends: 247 [2019-01-31 17:26:35,778 INFO L226 Difference]: Without dead ends: 165 [2019-01-31 17:26:35,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-31 17:26:35,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-01-31 17:26:35,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-01-31 17:26:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-31 17:26:35,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-01-31 17:26:35,781 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-01-31 17:26:35,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:26:35,782 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-01-31 17:26:35,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-31 17:26:35,782 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-01-31 17:26:35,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-01-31 17:26:35,783 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:26:35,783 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2019-01-31 17:26:35,783 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:26:35,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:26:35,783 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2019-01-31 17:26:35,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:26:35,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:35,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:26:35,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:35,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:26:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:26:38,410 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-31 17:26:38,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:38,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:26:38,410 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:26:38,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:26:38,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:38,411 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-31 17:26:38,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:26:38,418 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:26:41,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-31 17:26:41,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:26:41,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:26:41,387 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-31 17:26:41,387 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:26:48,661 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-31 17:26:48,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:26:48,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-01-31 17:26:48,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:26:48,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-31 17:26:48,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-31 17:26:48,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-31 17:26:48,687 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2019-01-31 17:26:49,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:26:49,530 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2019-01-31 17:26:49,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-31 17:26:49,530 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2019-01-31 17:26:49,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:26:49,531 INFO L225 Difference]: With dead ends: 250 [2019-01-31 17:26:49,531 INFO L226 Difference]: Without dead ends: 167 [2019-01-31 17:26:49,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-31 17:26:49,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-01-31 17:26:49,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-01-31 17:26:49,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-31 17:26:49,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-01-31 17:26:49,535 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2019-01-31 17:26:49,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:26:49,535 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-01-31 17:26:49,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-31 17:26:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-01-31 17:26:49,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-01-31 17:26:49,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:26:49,536 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2019-01-31 17:26:49,536 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:26:49,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:26:49,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2019-01-31 17:26:49,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:26:49,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:49,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:26:49,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:49,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:26:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:26:51,998 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-31 17:26:51,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:51,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:26:51,999 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:26:51,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:26:51,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:51,999 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-31 17:26:52,007 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:26:52,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:26:52,120 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:26:52,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:26:52,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:26:52,146 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-31 17:26:52,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:26:59,533 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-31 17:26:59,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:26:59,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-01-31 17:26:59,552 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:26:59,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-31 17:26:59,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-31 17:26:59,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-31 17:26:59,554 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2019-01-31 17:27:00,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:27:00,235 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2019-01-31 17:27:00,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-31 17:27:00,236 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2019-01-31 17:27:00,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:27:00,236 INFO L225 Difference]: With dead ends: 253 [2019-01-31 17:27:00,237 INFO L226 Difference]: Without dead ends: 169 [2019-01-31 17:27:00,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-31 17:27:00,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-01-31 17:27:00,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-01-31 17:27:00,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-31 17:27:00,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-01-31 17:27:00,240 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2019-01-31 17:27:00,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:27:00,240 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-01-31 17:27:00,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-31 17:27:00,240 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-01-31 17:27:00,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-01-31 17:27:00,241 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:27:00,241 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2019-01-31 17:27:00,241 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:27:00,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:27:00,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2019-01-31 17:27:00,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:27:00,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:00,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:27:00,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:00,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:27:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:27:02,651 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-31 17:27:02,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:02,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:27:02,652 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:27:02,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:27:02,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:02,652 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-31 17:27:02,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:27:02,662 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:27:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:27:02,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:27:02,799 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-31 17:27:02,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:27:10,380 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-31 17:27:10,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:27:10,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-01-31 17:27:10,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:27:10,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-31 17:27:10,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-31 17:27:10,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-31 17:27:10,400 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2019-01-31 17:27:11,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:27:11,262 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2019-01-31 17:27:11,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-31 17:27:11,262 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2019-01-31 17:27:11,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:27:11,263 INFO L225 Difference]: With dead ends: 256 [2019-01-31 17:27:11,263 INFO L226 Difference]: Without dead ends: 171 [2019-01-31 17:27:11,264 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-31 17:27:11,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-31 17:27:11,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-01-31 17:27:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-31 17:27:11,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2019-01-31 17:27:11,266 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2019-01-31 17:27:11,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:27:11,267 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2019-01-31 17:27:11,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-31 17:27:11,267 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2019-01-31 17:27:11,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-31 17:27:11,267 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:27:11,267 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2019-01-31 17:27:11,268 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:27:11,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:27:11,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2019-01-31 17:27:11,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:27:11,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:11,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:27:11,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:11,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:27:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:27:14,064 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-31 17:27:14,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:14,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:27:14,064 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:27:14,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:27:14,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:14,065 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-31 17:27:14,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:27:14,073 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:27:22,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-31 17:27:22,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:27:22,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:27:22,665 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-31 17:27:22,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:27:30,425 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-31 17:27:30,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:27:30,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-01-31 17:27:30,449 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:27:30,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-31 17:27:30,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-31 17:27:30,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-31 17:27:30,451 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2019-01-31 17:27:31,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:27:31,374 INFO L93 Difference]: Finished difference Result 259 states and 262 transitions. [2019-01-31 17:27:31,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-31 17:27:31,374 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2019-01-31 17:27:31,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:27:31,375 INFO L225 Difference]: With dead ends: 259 [2019-01-31 17:27:31,375 INFO L226 Difference]: Without dead ends: 173 [2019-01-31 17:27:31,376 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-31 17:27:31,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-31 17:27:31,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-01-31 17:27:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-31 17:27:31,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2019-01-31 17:27:31,379 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2019-01-31 17:27:31,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:27:31,379 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2019-01-31 17:27:31,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-31 17:27:31,379 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2019-01-31 17:27:31,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-01-31 17:27:31,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:27:31,380 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2019-01-31 17:27:31,380 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:27:31,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:27:31,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2019-01-31 17:27:31,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:27:31,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:31,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:27:31,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:31,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:27:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:27:33,969 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-31 17:27:33,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:33,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:27:33,969 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:27:33,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:27:33,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:33,969 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-31 17:27:33,977 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:27:33,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:27:34,096 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:27:34,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:27:34,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:27:34,123 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-31 17:27:34,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:27:42,630 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-31 17:27:42,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:27:42,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-01-31 17:27:42,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:27:42,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-31 17:27:42,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-31 17:27:42,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-31 17:27:42,651 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2019-01-31 17:27:43,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:27:43,610 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2019-01-31 17:27:43,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-31 17:27:43,610 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2019-01-31 17:27:43,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:27:43,611 INFO L225 Difference]: With dead ends: 262 [2019-01-31 17:27:43,611 INFO L226 Difference]: Without dead ends: 175 [2019-01-31 17:27:43,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-31 17:27:43,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-31 17:27:43,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-01-31 17:27:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-31 17:27:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-01-31 17:27:43,616 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2019-01-31 17:27:43,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:27:43,616 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-01-31 17:27:43,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-31 17:27:43,616 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-01-31 17:27:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-31 17:27:43,617 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:27:43,617 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2019-01-31 17:27:43,618 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:27:43,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:27:43,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2019-01-31 17:27:43,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:27:43,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:43,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:27:43,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:43,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:27:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:27:46,590 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-31 17:27:46,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:46,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:27:46,591 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:27:46,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:27:46,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:46,591 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-31 17:27:46,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:27:46,600 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:27:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:27:46,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:27:46,741 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-31 17:27:46,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:27:54,489 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-31 17:27:54,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:27:54,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-01-31 17:27:54,508 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:27:54,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-31 17:27:54,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-31 17:27:54,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-31 17:27:54,511 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2019-01-31 17:27:55,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:27:55,512 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2019-01-31 17:27:55,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-31 17:27:55,513 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2019-01-31 17:27:55,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:27:55,514 INFO L225 Difference]: With dead ends: 265 [2019-01-31 17:27:55,514 INFO L226 Difference]: Without dead ends: 177 [2019-01-31 17:27:55,515 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-31 17:27:55,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-31 17:27:55,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-01-31 17:27:55,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-31 17:27:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-01-31 17:27:55,518 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2019-01-31 17:27:55,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:27:55,518 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-01-31 17:27:55,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-31 17:27:55,518 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-01-31 17:27:55,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-01-31 17:27:55,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:27:55,519 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2019-01-31 17:27:55,520 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:27:55,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:27:55,520 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2019-01-31 17:27:55,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:27:55,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:55,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:27:55,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:55,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:27:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:27:58,253 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-31 17:27:58,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:58,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:27:58,253 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:27:58,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:27:58,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:58,254 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-31 17:27:58,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:27:58,262 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:28:07,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-31 17:28:07,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:28:07,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:28:07,251 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-31 17:28:07,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:28:15,396 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-31 17:28:15,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:28:15,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-01-31 17:28:15,421 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:28:15,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-31 17:28:15,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-31 17:28:15,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-31 17:28:15,424 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2019-01-31 17:28:16,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:28:16,284 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2019-01-31 17:28:16,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-31 17:28:16,284 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2019-01-31 17:28:16,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:28:16,285 INFO L225 Difference]: With dead ends: 268 [2019-01-31 17:28:16,286 INFO L226 Difference]: Without dead ends: 179 [2019-01-31 17:28:16,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-31 17:28:16,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-01-31 17:28:16,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-01-31 17:28:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-31 17:28:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-01-31 17:28:16,290 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2019-01-31 17:28:16,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:28:16,291 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-01-31 17:28:16,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-31 17:28:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-01-31 17:28:16,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-01-31 17:28:16,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:28:16,292 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2019-01-31 17:28:16,292 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:28:16,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:28:16,292 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2019-01-31 17:28:16,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:28:16,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:16,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:28:16,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:16,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:28:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:28:19,123 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-31 17:28:19,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:19,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:28:19,124 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:28:19,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:28:19,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:19,124 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-31 17:28:19,134 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:28:19,135 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:28:19,254 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:28:19,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:28:19,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:28:19,281 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-31 17:28:19,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:28:27,695 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-31 17:28:27,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:28:27,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-01-31 17:28:27,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:28:27,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-31 17:28:27,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-31 17:28:27,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-31 17:28:27,717 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2019-01-31 17:28:28,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:28:28,783 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2019-01-31 17:28:28,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-31 17:28:28,783 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2019-01-31 17:28:28,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:28:28,784 INFO L225 Difference]: With dead ends: 271 [2019-01-31 17:28:28,784 INFO L226 Difference]: Without dead ends: 181 [2019-01-31 17:28:28,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-31 17:28:28,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-01-31 17:28:28,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-01-31 17:28:28,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-31 17:28:28,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2019-01-31 17:28:28,788 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2019-01-31 17:28:28,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:28:28,788 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2019-01-31 17:28:28,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-31 17:28:28,789 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2019-01-31 17:28:28,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-31 17:28:28,789 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:28:28,789 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2019-01-31 17:28:28,789 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:28:28,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:28:28,790 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2019-01-31 17:28:28,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:28:28,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:28,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:28:28,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:28,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:28:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:28:31,854 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-31 17:28:31,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:31,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:28:31,854 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:28:31,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:28:31,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:31,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:28:31,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:28:31,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:28:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:28:31,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:28:32,013 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-31 17:28:32,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:28:40,222 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-31 17:28:40,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:28:40,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-01-31 17:28:40,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:28:40,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-31 17:28:40,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-31 17:28:40,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-31 17:28:40,243 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2019-01-31 17:28:41,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:28:41,062 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-01-31 17:28:41,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-31 17:28:41,062 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2019-01-31 17:28:41,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:28:41,063 INFO L225 Difference]: With dead ends: 274 [2019-01-31 17:28:41,063 INFO L226 Difference]: Without dead ends: 183 [2019-01-31 17:28:41,064 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-31 17:28:41,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-01-31 17:28:41,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-01-31 17:28:41,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-01-31 17:28:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-01-31 17:28:41,067 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2019-01-31 17:28:41,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:28:41,068 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-01-31 17:28:41,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-31 17:28:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-01-31 17:28:41,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-01-31 17:28:41,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:28:41,068 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2019-01-31 17:28:41,069 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:28:41,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:28:41,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2019-01-31 17:28:41,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:28:41,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:41,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:28:41,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:41,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:28:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:28:43,939 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-31 17:28:43,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:43,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:28:43,939 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:28:43,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:28:43,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:43,939 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-31 17:28:43,947 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:28:43,947 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:28:48,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-31 17:28:48,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:28:48,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:28:48,630 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-31 17:28:48,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:28:57,300 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-31 17:28:57,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:28:57,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-01-31 17:28:57,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:28:57,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-31 17:28:57,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-31 17:28:57,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-31 17:28:57,329 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2019-01-31 17:28:58,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:28:58,196 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2019-01-31 17:28:58,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-31 17:28:58,196 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2019-01-31 17:28:58,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:28:58,197 INFO L225 Difference]: With dead ends: 277 [2019-01-31 17:28:58,197 INFO L226 Difference]: Without dead ends: 185 [2019-01-31 17:28:58,198 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-31 17:28:58,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-31 17:28:58,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-01-31 17:28:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-31 17:28:58,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-01-31 17:28:58,201 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2019-01-31 17:28:58,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:28:58,201 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-01-31 17:28:58,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-31 17:28:58,201 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-01-31 17:28:58,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-31 17:28:58,202 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:28:58,202 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2019-01-31 17:28:58,202 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:28:58,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:28:58,202 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2019-01-31 17:28:58,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:28:58,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:58,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:28:58,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:58,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:28:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:29:01,415 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-31 17:29:01,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:01,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:29:01,416 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:29:01,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:29:01,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:01,416 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-31 17:29:01,423 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:29:01,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:29:01,548 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:29:01,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:29:01,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:29:01,578 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-31 17:29:01,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:29:09,896 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-31 17:29:09,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:29:09,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-01-31 17:29:09,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:29:09,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-31 17:29:09,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-31 17:29:09,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-31 17:29:09,917 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2019-01-31 17:29:10,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:29:10,849 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2019-01-31 17:29:10,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-31 17:29:10,850 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2019-01-31 17:29:10,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:29:10,851 INFO L225 Difference]: With dead ends: 280 [2019-01-31 17:29:10,851 INFO L226 Difference]: Without dead ends: 187 [2019-01-31 17:29:10,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-31 17:29:10,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-31 17:29:10,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-01-31 17:29:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-31 17:29:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-01-31 17:29:10,856 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2019-01-31 17:29:10,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:29:10,856 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2019-01-31 17:29:10,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-31 17:29:10,856 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2019-01-31 17:29:10,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-31 17:29:10,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:29:10,857 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2019-01-31 17:29:10,858 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:29:10,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:29:10,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2019-01-31 17:29:10,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:29:10,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:10,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:29:10,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:10,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:29:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:29:14,303 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-31 17:29:14,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:14,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:29:14,304 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:29:14,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:29:14,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:14,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:29:14,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:29:14,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:29:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:29:14,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:29:14,468 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-31 17:29:14,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:29:23,411 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-31 17:29:23,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:29:23,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-01-31 17:29:23,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:29:23,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-31 17:29:23,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-31 17:29:23,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-31 17:29:23,432 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2019-01-31 17:29:24,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:29:24,682 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2019-01-31 17:29:24,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-31 17:29:24,682 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2019-01-31 17:29:24,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:29:24,683 INFO L225 Difference]: With dead ends: 283 [2019-01-31 17:29:24,683 INFO L226 Difference]: Without dead ends: 189 [2019-01-31 17:29:24,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-31 17:29:24,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-31 17:29:24,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-01-31 17:29:24,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-31 17:29:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2019-01-31 17:29:24,688 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2019-01-31 17:29:24,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:29:24,688 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2019-01-31 17:29:24,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-31 17:29:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2019-01-31 17:29:24,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-01-31 17:29:24,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:29:24,690 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2019-01-31 17:29:24,690 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:29:24,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:29:24,690 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2019-01-31 17:29:24,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:29:24,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:24,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:29:24,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:24,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:29:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:29:28,134 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-31 17:29:28,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:28,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:29:28,135 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:29:28,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:29:28,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:28,135 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-31 17:29:28,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:29:28,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:29:33,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-01-31 17:29:33,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:29:33,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:29:33,215 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-31 17:29:33,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:29:42,015 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-31 17:29:42,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:29:42,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-01-31 17:29:42,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:29:42,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-31 17:29:42,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-31 17:29:42,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-31 17:29:42,044 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2019-01-31 17:29:43,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:29:43,193 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-01-31 17:29:43,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-31 17:29:43,194 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2019-01-31 17:29:43,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:29:43,195 INFO L225 Difference]: With dead ends: 286 [2019-01-31 17:29:43,195 INFO L226 Difference]: Without dead ends: 191 [2019-01-31 17:29:43,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-31 17:29:43,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-01-31 17:29:43,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-01-31 17:29:43,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-31 17:29:43,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-01-31 17:29:43,199 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2019-01-31 17:29:43,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:29:43,199 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-01-31 17:29:43,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-31 17:29:43,199 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-01-31 17:29:43,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-01-31 17:29:43,200 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:29:43,200 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2019-01-31 17:29:43,200 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:29:43,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:29:43,200 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2019-01-31 17:29:43,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:29:43,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:43,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:29:43,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:43,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:29:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:29:46,399 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-31 17:29:46,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:46,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:29:46,399 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:29:46,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:29:46,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:46,399 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-31 17:29:46,408 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:29:46,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:29:46,539 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:29:46,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:29:46,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:29:46,569 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-31 17:29:46,570 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:29:56,057 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-31 17:29:56,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:29:56,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-01-31 17:29:56,077 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:29:56,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-31 17:29:56,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-31 17:29:56,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-31 17:29:56,079 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2019-01-31 17:29:57,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:29:57,370 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2019-01-31 17:29:57,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-31 17:29:57,371 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2019-01-31 17:29:57,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:29:57,371 INFO L225 Difference]: With dead ends: 289 [2019-01-31 17:29:57,371 INFO L226 Difference]: Without dead ends: 193 [2019-01-31 17:29:57,373 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-31 17:29:57,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-01-31 17:29:57,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-01-31 17:29:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-31 17:29:57,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-01-31 17:29:57,375 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2019-01-31 17:29:57,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:29:57,375 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-01-31 17:29:57,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-31 17:29:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-01-31 17:29:57,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-31 17:29:57,376 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:29:57,376 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2019-01-31 17:29:57,376 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:29:57,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:29:57,377 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2019-01-31 17:29:57,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:29:57,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:57,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:29:57,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:57,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:29:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:30:00,825 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-31 17:30:00,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:30:00,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:30:00,825 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:30:00,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:30:00,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:30:00,826 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-31 17:30:00,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:30:00,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:30:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:30:00,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:30:00,995 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-31 17:30:00,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:30:10,567 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-31 17:30:10,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:30:10,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-01-31 17:30:10,586 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:30:10,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-31 17:30:10,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-31 17:30:10,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-31 17:30:10,588 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2019-01-31 17:30:11,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:30:11,928 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2019-01-31 17:30:11,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-31 17:30:11,928 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2019-01-31 17:30:11,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:30:11,929 INFO L225 Difference]: With dead ends: 292 [2019-01-31 17:30:11,929 INFO L226 Difference]: Without dead ends: 195 [2019-01-31 17:30:11,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-31 17:30:11,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-31 17:30:11,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-01-31 17:30:11,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-01-31 17:30:11,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2019-01-31 17:30:11,934 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2019-01-31 17:30:11,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:30:11,934 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2019-01-31 17:30:11,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-31 17:30:11,935 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2019-01-31 17:30:11,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-01-31 17:30:11,935 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:30:11,936 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2019-01-31 17:30:11,936 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:30:11,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:30:11,936 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2019-01-31 17:30:11,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:30:11,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:30:11,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:30:11,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:30:11,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:30:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:30:15,476 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-31 17:30:15,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:30:15,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:30:15,477 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:30:15,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:30:15,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:30:15,477 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-31 17:30:15,486 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:30:15,486 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:30:21,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-01-31 17:30:21,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:30:21,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:30:21,438 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-31 17:30:21,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:30:31,129 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-31 17:30:31,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:30:31,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-01-31 17:30:31,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:30:31,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-31 17:30:31,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-31 17:30:31,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-31 17:30:31,160 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2019-01-31 17:30:32,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:30:32,677 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-01-31 17:30:32,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-31 17:30:32,678 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2019-01-31 17:30:32,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:30:32,679 INFO L225 Difference]: With dead ends: 295 [2019-01-31 17:30:32,679 INFO L226 Difference]: Without dead ends: 197 [2019-01-31 17:30:32,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-31 17:30:32,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-31 17:30:32,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-01-31 17:30:32,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-31 17:30:32,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2019-01-31 17:30:32,684 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2019-01-31 17:30:32,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:30:32,684 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2019-01-31 17:30:32,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-31 17:30:32,684 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2019-01-31 17:30:32,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-01-31 17:30:32,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:30:32,685 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2019-01-31 17:30:32,685 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:30:32,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:30:32,686 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2019-01-31 17:30:32,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:30:32,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:30:32,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:30:32,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:30:32,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:30:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:30:36,183 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-31 17:30:36,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:30:36,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:30:36,183 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:30:36,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:30:36,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:30:36,183 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-31 17:30:36,212 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:30:36,212 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:30:36,346 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:30:36,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:30:36,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:30:36,379 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-31 17:30:36,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:30:46,453 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-31 17:30:46,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:30:46,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-01-31 17:30:46,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:30:46,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-31 17:30:46,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-31 17:30:46,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-31 17:30:46,474 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2019-01-31 17:30:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:30:47,971 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2019-01-31 17:30:47,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-31 17:30:47,972 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2019-01-31 17:30:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:30:47,972 INFO L225 Difference]: With dead ends: 298 [2019-01-31 17:30:47,973 INFO L226 Difference]: Without dead ends: 199 [2019-01-31 17:30:47,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-31 17:30:47,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-31 17:30:47,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-01-31 17:30:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-31 17:30:47,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-01-31 17:30:47,976 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2019-01-31 17:30:47,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:30:47,977 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-01-31 17:30:47,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-31 17:30:47,977 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-01-31 17:30:47,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-31 17:30:47,977 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:30:47,977 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2019-01-31 17:30:47,978 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:30:47,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:30:47,978 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2019-01-31 17:30:47,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:30:47,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:30:47,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:30:47,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:30:47,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:30:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:30:51,694 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-31 17:30:51,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:30:51,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:30:51,694 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:30:51,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:30:51,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:30:51,694 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-31 17:30:51,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:30:51,703 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:30:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:30:51,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:30:51,870 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-31 17:30:51,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:31:02,183 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-31 17:31:02,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:31:02,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-01-31 17:31:02,202 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:31:02,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-31 17:31:02,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-31 17:31:02,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-31 17:31:02,205 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2019-01-31 17:31:03,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:31:03,391 INFO L93 Difference]: Finished difference Result 301 states and 304 transitions. [2019-01-31 17:31:03,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-31 17:31:03,391 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2019-01-31 17:31:03,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:31:03,392 INFO L225 Difference]: With dead ends: 301 [2019-01-31 17:31:03,392 INFO L226 Difference]: Without dead ends: 201 [2019-01-31 17:31:03,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-31 17:31:03,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-31 17:31:03,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-01-31 17:31:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-31 17:31:03,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-01-31 17:31:03,396 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2019-01-31 17:31:03,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:31:03,396 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-01-31 17:31:03,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-31 17:31:03,396 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-01-31 17:31:03,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-31 17:31:03,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:31:03,397 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2019-01-31 17:31:03,397 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:31:03,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:31:03,397 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2019-01-31 17:31:03,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:31:03,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:31:03,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:31:03,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:31:03,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:31:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:31:07,104 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-31 17:31:07,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:31:07,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:31:07,105 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:31:07,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:31:07,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:31:07,105 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-31 17:31:07,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:31:07,114 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:31:21,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-01-31 17:31:21,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:31:21,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:31:21,701 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-31 17:31:21,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:31:32,353 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-31 17:31:32,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:31:32,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-01-31 17:31:32,380 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:31:32,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-31 17:31:32,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-31 17:31:32,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-31 17:31:32,382 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2019-01-31 17:31:33,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:31:33,906 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2019-01-31 17:31:33,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-31 17:31:33,906 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2019-01-31 17:31:33,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:31:33,907 INFO L225 Difference]: With dead ends: 304 [2019-01-31 17:31:33,907 INFO L226 Difference]: Without dead ends: 203 [2019-01-31 17:31:33,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-31 17:31:33,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-31 17:31:33,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-01-31 17:31:33,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-31 17:31:33,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2019-01-31 17:31:33,911 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2019-01-31 17:31:33,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:31:33,911 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2019-01-31 17:31:33,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-31 17:31:33,911 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2019-01-31 17:31:33,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-01-31 17:31:33,912 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:31:33,912 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2019-01-31 17:31:33,912 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:31:33,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:31:33,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2019-01-31 17:31:33,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:31:33,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:31:33,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:31:33,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:31:33,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:31:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:31:37,640 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-31 17:31:37,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:31:37,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:31:37,641 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:31:37,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:31:37,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:31:37,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:31:37,651 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:31:37,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:31:37,787 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:31:37,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:31:37,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:31:37,822 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-31 17:31:37,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:31:48,318 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-31 17:31:48,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:31:48,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-01-31 17:31:48,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:31:48,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-31 17:31:48,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-31 17:31:48,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-31 17:31:48,340 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2019-01-31 17:31:49,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:31:49,927 INFO L93 Difference]: Finished difference Result 307 states and 310 transitions. [2019-01-31 17:31:49,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-31 17:31:49,928 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2019-01-31 17:31:49,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:31:49,929 INFO L225 Difference]: With dead ends: 307 [2019-01-31 17:31:49,929 INFO L226 Difference]: Without dead ends: 205 [2019-01-31 17:31:49,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-31 17:31:49,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-01-31 17:31:49,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-01-31 17:31:49,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-01-31 17:31:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-01-31 17:31:49,933 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2019-01-31 17:31:49,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:31:49,933 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-01-31 17:31:49,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-31 17:31:49,933 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-01-31 17:31:49,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-01-31 17:31:49,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:31:49,934 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2019-01-31 17:31:49,934 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:31:49,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:31:49,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2019-01-31 17:31:49,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:31:49,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:31:49,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:31:49,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:31:49,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:31:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:31:53,831 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-31 17:31:53,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:31:53,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:31:53,831 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:31:53,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:31:53,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:31:53,832 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-31 17:31:53,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:31:53,840 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:31:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:31:53,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:31:54,009 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-31 17:31:54,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:32:04,952 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-31 17:32:04,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:32:04,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-01-31 17:32:04,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:32:04,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-31 17:32:04,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-31 17:32:04,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-31 17:32:04,974 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2019-01-31 17:32:06,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:32:06,514 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2019-01-31 17:32:06,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-31 17:32:06,514 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2019-01-31 17:32:06,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:32:06,515 INFO L225 Difference]: With dead ends: 310 [2019-01-31 17:32:06,515 INFO L226 Difference]: Without dead ends: 207 [2019-01-31 17:32:06,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-31 17:32:06,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-31 17:32:06,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-01-31 17:32:06,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-01-31 17:32:06,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-01-31 17:32:06,521 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2019-01-31 17:32:06,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:32:06,522 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-01-31 17:32:06,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-31 17:32:06,522 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-01-31 17:32:06,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-01-31 17:32:06,523 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:32:06,523 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2019-01-31 17:32:06,523 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:32:06,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:32:06,523 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2019-01-31 17:32:06,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:32:06,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:32:06,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:32:06,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:32:06,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:32:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:32:10,152 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-31 17:32:10,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:32:10,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:32:10,153 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:32:10,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:32:10,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:32:10,153 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-31 17:32:10,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:32:10,161 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:32:28,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-31 17:32:28,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:32:28,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:32:28,610 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-31 17:32:28,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:32:39,940 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-31 17:32:39,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:32:39,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-01-31 17:32:39,969 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:32:39,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-31 17:32:39,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-31 17:32:39,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-31 17:32:39,972 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2019-01-31 17:32:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:32:41,660 INFO L93 Difference]: Finished difference Result 313 states and 316 transitions. [2019-01-31 17:32:41,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-31 17:32:41,660 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2019-01-31 17:32:41,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:32:41,661 INFO L225 Difference]: With dead ends: 313 [2019-01-31 17:32:41,661 INFO L226 Difference]: Without dead ends: 209 [2019-01-31 17:32:41,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-31 17:32:41,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-31 17:32:41,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-01-31 17:32:41,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-01-31 17:32:41,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-01-31 17:32:41,667 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2019-01-31 17:32:41,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:32:41,668 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-01-31 17:32:41,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-31 17:32:41,668 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-01-31 17:32:41,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-01-31 17:32:41,669 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:32:41,669 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1] [2019-01-31 17:32:41,669 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:32:41,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:32:41,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1650876630, now seen corresponding path program 102 times [2019-01-31 17:32:41,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:32:41,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:32:41,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:32:41,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:32:41,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:32:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:32:45,383 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-31 17:32:45,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:32:45,383 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:32:45,384 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:32:45,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:32:45,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:32:45,384 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-31 17:32:45,391 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:32:45,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:32:45,534 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:32:45,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:32:45,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:32:45,568 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-31 17:32:45,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:32:56,607 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-31 17:32:56,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:32:56,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-01-31 17:32:56,626 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:32:56,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-31 17:32:56,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-31 17:32:56,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-31 17:32:56,629 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2019-01-31 17:32:58,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:32:58,148 INFO L93 Difference]: Finished difference Result 316 states and 319 transitions. [2019-01-31 17:32:58,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-31 17:32:58,148 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2019-01-31 17:32:58,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:32:58,149 INFO L225 Difference]: With dead ends: 316 [2019-01-31 17:32:58,149 INFO L226 Difference]: Without dead ends: 211 [2019-01-31 17:32:58,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-31 17:32:58,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-01-31 17:32:58,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-01-31 17:32:58,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-01-31 17:32:58,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2019-01-31 17:32:58,156 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2019-01-31 17:32:58,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:32:58,156 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2019-01-31 17:32:58,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-31 17:32:58,156 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2019-01-31 17:32:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-01-31 17:32:58,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:32:58,157 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1] [2019-01-31 17:32:58,157 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:32:58,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:32:58,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1160939221, now seen corresponding path program 103 times [2019-01-31 17:32:58,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:32:58,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:32:58,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:32:58,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:32:58,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:32:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:33:02,213 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-31 17:33:02,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:33:02,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:33:02,214 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:33:02,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:33:02,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:33:02,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 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-31 17:33:02,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:33:02,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:33:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:33:02,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:33:02,406 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-31 17:33:02,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:33:13,888 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-31 17:33:13,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:33:13,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-01-31 17:33:13,908 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:33:13,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-31 17:33:13,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-31 17:33:13,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-31 17:33:13,911 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 106 states. [2019-01-31 17:33:15,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:33:15,623 INFO L93 Difference]: Finished difference Result 319 states and 322 transitions. [2019-01-31 17:33:15,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-01-31 17:33:15,623 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2019-01-31 17:33:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:33:15,624 INFO L225 Difference]: With dead ends: 319 [2019-01-31 17:33:15,624 INFO L226 Difference]: Without dead ends: 213 [2019-01-31 17:33:15,626 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-31 17:33:15,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-01-31 17:33:15,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-01-31 17:33:15,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-31 17:33:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2019-01-31 17:33:15,630 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2019-01-31 17:33:15,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:33:15,630 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2019-01-31 17:33:15,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-31 17:33:15,630 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2019-01-31 17:33:15,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-31 17:33:15,631 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:33:15,631 INFO L402 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1] [2019-01-31 17:33:15,631 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:33:15,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:33:15,632 INFO L82 PathProgramCache]: Analyzing trace with hash 193908298, now seen corresponding path program 104 times [2019-01-31 17:33:15,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:33:15,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:33:15,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:33:15,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:33:15,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:33:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:33:19,669 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-31 17:33:19,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:33:19,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:33:19,670 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:33:19,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:33:19,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:33:19,670 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-31 17:33:19,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:33:19,679 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:33:27,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-01-31 17:33:27,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:33:27,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:33:27,934 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-31 17:33:27,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:33:39,424 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-31 17:33:39,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:33:39,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-01-31 17:33:39,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:33:39,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-31 17:33:39,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-31 17:33:39,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-31 17:33:39,456 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 107 states. [2019-01-31 17:33:40,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:33:40,884 INFO L93 Difference]: Finished difference Result 322 states and 325 transitions. [2019-01-31 17:33:40,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-31 17:33:40,885 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2019-01-31 17:33:40,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:33:40,885 INFO L225 Difference]: With dead ends: 322 [2019-01-31 17:33:40,885 INFO L226 Difference]: Without dead ends: 215 [2019-01-31 17:33:40,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-31 17:33:40,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-31 17:33:40,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-01-31 17:33:40,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-01-31 17:33:40,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2019-01-31 17:33:40,892 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 212 [2019-01-31 17:33:40,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:33:40,892 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2019-01-31 17:33:40,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-31 17:33:40,892 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2019-01-31 17:33:40,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-01-31 17:33:40,893 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:33:40,893 INFO L402 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1, 1] [2019-01-31 17:33:40,893 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:33:40,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:33:40,894 INFO L82 PathProgramCache]: Analyzing trace with hash 913063733, now seen corresponding path program 105 times [2019-01-31 17:33:40,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:33:40,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:33:40,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:33:40,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:33:40,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:33:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:33:45,110 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-31 17:33:45,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:33:45,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:33:45,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:33:45,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:33:45,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:33:45,110 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-31 17:33:45,119 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:33:45,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:33:45,270 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:33:45,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:33:45,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:33:45,311 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-31 17:33:45,311 INFO L316 TraceCheckSpWp]: Computing backward predicates...