java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 16:54:12,234 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 16:54:12,236 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 16:54:12,248 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 16:54:12,248 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 16:54:12,249 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 16:54:12,250 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 16:54:12,252 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 16:54:12,254 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 16:54:12,255 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 16:54:12,256 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 16:54:12,256 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 16:54:12,257 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 16:54:12,258 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 16:54:12,259 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 16:54:12,263 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 16:54:12,265 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 16:54:12,267 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 16:54:12,272 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 16:54:12,275 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 16:54:12,277 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 16:54:12,280 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 16:54:12,288 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 16:54:12,288 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 16:54:12,288 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 16:54:12,289 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 16:54:12,290 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 16:54:12,291 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 16:54:12,296 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 16:54:12,298 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 16:54:12,298 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 16:54:12,299 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 16:54:12,299 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 16:54:12,299 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 16:54:12,302 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 16:54:12,303 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 16:54:12,303 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-31 16:54:12,329 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 16:54:12,329 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 16:54:12,330 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 16:54:12,330 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 16:54:12,330 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 16:54:12,331 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 16:54:12,331 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 16:54:12,331 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 16:54:12,331 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 16:54:12,332 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 16:54:12,332 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 16:54:12,332 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 16:54:12,332 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 16:54:12,332 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 16:54:12,333 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 16:54:12,333 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 16:54:12,333 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 16:54:12,334 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 16:54:12,334 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 16:54:12,334 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 16:54:12,334 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 16:54:12,334 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 16:54:12,335 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 16:54:12,335 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 16:54:12,335 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 16:54:12,335 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 16:54:12,335 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 16:54:12,336 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 16:54:12,336 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 16:54:12,336 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 16:54:12,336 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 16:54:12,336 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 16:54:12,337 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 16:54:12,337 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 16:54:12,337 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 16:54:12,337 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 16:54:12,337 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 16:54:12,337 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 16:54:12,338 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 16:54:12,338 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 16:54:12,368 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 16:54:12,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 16:54:12,384 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 16:54:12,386 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 16:54:12,387 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 16:54:12,388 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl [2019-01-31 16:54:12,388 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl' [2019-01-31 16:54:12,427 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 16:54:12,429 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 16:54:12,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 16:54:12,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 16:54:12,430 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 16:54:12,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:12" (1/1) ... [2019-01-31 16:54:12,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:12" (1/1) ... [2019-01-31 16:54:12,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 16:54:12,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 16:54:12,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 16:54:12,467 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 16:54:12,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:12" (1/1) ... [2019-01-31 16:54:12,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:12" (1/1) ... [2019-01-31 16:54:12,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:12" (1/1) ... [2019-01-31 16:54:12,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:12" (1/1) ... [2019-01-31 16:54:12,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:12" (1/1) ... [2019-01-31 16:54:12,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:12" (1/1) ... [2019-01-31 16:54:12,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:12" (1/1) ... [2019-01-31 16:54:12,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 16:54:12,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 16:54:12,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 16:54:12,488 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 16:54:12,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:12" (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 16:54:12,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 16:54:12,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 16:54:12,747 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 16:54:12,747 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-31 16:54:12,748 INFO L202 PluginConnector]: Adding new model array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:54:12 BoogieIcfgContainer [2019-01-31 16:54:12,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 16:54:12,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 16:54:12,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 16:54:12,753 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 16:54:12,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:12" (1/2) ... [2019-01-31 16:54:12,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1145762f and model type array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:54:12, skipping insertion in model container [2019-01-31 16:54:12,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:54:12" (2/2) ... [2019-01-31 16:54:12,756 INFO L112 eAbstractionObserver]: Analyzing ICFG array1.i_3.bpl [2019-01-31 16:54:12,767 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 16:54:12,775 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 16:54:12,794 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 16:54:12,834 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 16:54:12,835 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 16:54:12,835 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 16:54:12,835 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 16:54:12,835 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 16:54:12,836 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 16:54:12,836 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 16:54:12,836 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 16:54:12,854 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-31 16:54:12,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 16:54:12,865 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:12,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 16:54:12,870 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:12,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:12,878 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-01-31 16:54:12,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:12,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:12,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:12,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:12,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:13,060 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 16:54:13,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 16:54:13,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 16:54:13,062 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 16:54:13,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 16:54:13,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 16:54:13,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 16:54:13,079 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-31 16:54:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:13,119 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-31 16:54:13,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 16:54:13,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 16:54:13,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:13,137 INFO L225 Difference]: With dead ends: 9 [2019-01-31 16:54:13,137 INFO L226 Difference]: Without dead ends: 5 [2019-01-31 16:54:13,141 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 16:54:13,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-31 16:54:13,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-31 16:54:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 16:54:13,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-31 16:54:13,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-31 16:54:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:13,171 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-31 16:54:13,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 16:54:13,171 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 16:54:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 16:54:13,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:13,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 16:54:13,172 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:13,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:13,173 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-01-31 16:54:13,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:13,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:13,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:13,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:13,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:13,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:13,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:13,280 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 16:54:13,282 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-01-31 16:54:13,319 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 16:54:13,320 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 16:54:13,429 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 16:54:13,431 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 1 different actions 3 times. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 5. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 16:54:13,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:13,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 16:54:13,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:13,438 INFO 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 16:54:13,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:13,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:13,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:13,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:13,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:13,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-31 16:54:13,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:13,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 16:54:13,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 16:54:13,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-31 16:54:13,839 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-01-31 16:54:13,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:13,930 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-31 16:54:13,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 16:54:13,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 16:54:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:13,931 INFO L225 Difference]: With dead ends: 8 [2019-01-31 16:54:13,931 INFO L226 Difference]: Without dead ends: 6 [2019-01-31 16:54:13,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-31 16:54:13,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-31 16:54:13,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-31 16:54:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 16:54:13,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-31 16:54:13,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-31 16:54:13,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:13,957 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-31 16:54:13,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 16:54:13,957 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-31 16:54:13,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 16:54:13,958 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:13,958 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-31 16:54:13,958 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:13,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:13,959 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-01-31 16:54:13,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:13,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:13,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:13,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:13,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:14,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:14,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:14,047 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:14,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:14,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:14,047 INFO 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 16:54:14,060 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:14,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:14,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 16:54:14,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:14,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:14,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:14,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:14,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:14,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:14,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-31 16:54:14,214 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:14,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 16:54:14,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 16:54:14,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-31 16:54:14,215 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-01-31 16:54:14,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:14,312 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-31 16:54:14,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 16:54:14,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-31 16:54:14,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:14,313 INFO L225 Difference]: With dead ends: 9 [2019-01-31 16:54:14,313 INFO L226 Difference]: Without dead ends: 7 [2019-01-31 16:54:14,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-31 16:54:14,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-31 16:54:14,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-31 16:54:14,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 16:54:14,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-31 16:54:14,317 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-31 16:54:14,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:14,317 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-31 16:54:14,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 16:54:14,317 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-31 16:54:14,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 16:54:14,318 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:14,318 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-31 16:54:14,319 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:14,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:14,319 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-01-31 16:54:14,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:14,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:14,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:14,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:14,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:14,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:14,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:14,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:14,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:14,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:14,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:14,617 INFO 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 16:54:14,630 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:14,630 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:14,647 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:14,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:14,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:14,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:14,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:14,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:14,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-31 16:54:14,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:14,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 16:54:14,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 16:54:14,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-31 16:54:14,841 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-01-31 16:54:14,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:14,857 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-31 16:54:14,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 16:54:14,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-01-31 16:54:14,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:14,858 INFO L225 Difference]: With dead ends: 10 [2019-01-31 16:54:14,858 INFO L226 Difference]: Without dead ends: 8 [2019-01-31 16:54:14,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-31 16:54:14,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-31 16:54:14,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-31 16:54:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 16:54:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-31 16:54:14,862 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-31 16:54:14,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:14,863 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-31 16:54:14,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 16:54:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-31 16:54:14,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 16:54:14,863 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:14,863 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-31 16:54:14,864 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:14,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:14,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-01-31 16:54:14,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:14,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:14,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:14,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:14,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:15,036 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:15,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:15,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:15,036 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:15,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:15,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:15,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:54:15,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:15,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:15,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:15,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:15,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:15,195 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:15,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:15,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-31 16:54:15,215 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:15,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 16:54:15,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 16:54:15,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-31 16:54:15,216 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-01-31 16:54:15,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:15,238 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-31 16:54:15,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 16:54:15,240 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-31 16:54:15,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:15,241 INFO L225 Difference]: With dead ends: 11 [2019-01-31 16:54:15,241 INFO L226 Difference]: Without dead ends: 9 [2019-01-31 16:54:15,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-31 16:54:15,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-31 16:54:15,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-31 16:54:15,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-31 16:54:15,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-31 16:54:15,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-01-31 16:54:15,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:15,246 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-31 16:54:15,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 16:54:15,246 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-31 16:54:15,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 16:54:15,247 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:15,247 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-01-31 16:54:15,247 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:15,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:15,248 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-01-31 16:54:15,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:15,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:15,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:15,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:15,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:15,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:15,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:15,333 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:15,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:15,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:15,334 INFO 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 16:54:15,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:15,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:15,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-31 16:54:15,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:15,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:15,361 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:15,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:15,814 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:15,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:15,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-31 16:54:15,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:15,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 16:54:15,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 16:54:15,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-31 16:54:15,834 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-01-31 16:54:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:15,870 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-31 16:54:15,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 16:54:15,871 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-31 16:54:15,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:15,872 INFO L225 Difference]: With dead ends: 12 [2019-01-31 16:54:15,872 INFO L226 Difference]: Without dead ends: 10 [2019-01-31 16:54:15,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-31 16:54:15,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-31 16:54:15,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-31 16:54:15,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 16:54:15,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-31 16:54:15,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-01-31 16:54:15,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:15,876 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-31 16:54:15,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 16:54:15,876 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-31 16:54:15,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 16:54:15,877 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:15,877 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-01-31 16:54:15,877 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:15,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:15,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-01-31 16:54:15,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:15,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:15,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:15,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:15,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:16,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:16,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:16,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:16,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:16,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:16,011 INFO 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 16:54:16,020 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:16,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:16,029 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:16,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:16,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:16,037 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:16,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:16,149 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:16,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:16,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-31 16:54:16,169 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:16,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 16:54:16,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 16:54:16,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-31 16:54:16,171 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-01-31 16:54:16,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:16,214 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-01-31 16:54:16,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 16:54:16,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-31 16:54:16,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:16,216 INFO L225 Difference]: With dead ends: 13 [2019-01-31 16:54:16,216 INFO L226 Difference]: Without dead ends: 11 [2019-01-31 16:54:16,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 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 16:54:16,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-31 16:54:16,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-31 16:54:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-31 16:54:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-31 16:54:16,219 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-01-31 16:54:16,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:16,220 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-31 16:54:16,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 16:54:16,220 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-31 16:54:16,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-31 16:54:16,220 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:16,220 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-01-31 16:54:16,221 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:16,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:16,221 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-01-31 16:54:16,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:16,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:16,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:16,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:16,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:16,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:16,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:16,364 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:16,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:16,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:16,365 INFO 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 16:54:16,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:16,377 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:16,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:16,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:16,637 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:16,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:16,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-31 16:54:16,658 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:16,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 16:54:16,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 16:54:16,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-31 16:54:16,659 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-01-31 16:54:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:16,711 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-31 16:54:16,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 16:54:16,717 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-01-31 16:54:16,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:16,718 INFO L225 Difference]: With dead ends: 14 [2019-01-31 16:54:16,718 INFO L226 Difference]: Without dead ends: 12 [2019-01-31 16:54:16,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 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 16:54:16,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-31 16:54:16,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-31 16:54:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-31 16:54:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-31 16:54:16,721 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-01-31 16:54:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:16,721 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-31 16:54:16,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 16:54:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-31 16:54:16,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-31 16:54:16,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:16,722 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-01-31 16:54:16,722 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:16,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:16,723 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-01-31 16:54:16,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:16,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:16,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:16,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:16,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:16,847 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:16,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:16,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:16,847 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:16,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:16,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:16,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:54:16,861 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:16,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:16,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-31 16:54:16,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:16,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:16,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:17,071 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:17,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:17,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-31 16:54:17,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:17,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 16:54:17,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 16:54:17,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-31 16:54:17,094 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-01-31 16:54:17,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:17,125 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-31 16:54:17,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 16:54:17,126 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-01-31 16:54:17,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:17,126 INFO L225 Difference]: With dead ends: 15 [2019-01-31 16:54:17,127 INFO L226 Difference]: Without dead ends: 13 [2019-01-31 16:54:17,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 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 16:54:17,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-31 16:54:17,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-31 16:54:17,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-31 16:54:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-31 16:54:17,130 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-01-31 16:54:17,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:17,131 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-31 16:54:17,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 16:54:17,131 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-31 16:54:17,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-31 16:54:17,132 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:17,132 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-01-31 16:54:17,132 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:17,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:17,132 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-01-31 16:54:17,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:17,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:17,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:17,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:17,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:17,450 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:17,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:17,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:17,451 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:17,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:17,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:17,451 INFO 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 16:54:17,461 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:17,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:17,473 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:17,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:17,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:17,483 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:17,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:17,826 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:17,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:17,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-31 16:54:17,846 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:17,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 16:54:17,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 16:54:17,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-31 16:54:17,847 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-01-31 16:54:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:17,896 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-01-31 16:54:17,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 16:54:17,896 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-01-31 16:54:17,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:17,897 INFO L225 Difference]: With dead ends: 16 [2019-01-31 16:54:17,898 INFO L226 Difference]: Without dead ends: 14 [2019-01-31 16:54:17,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-31 16:54:17,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-31 16:54:17,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-31 16:54:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-31 16:54:17,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-31 16:54:17,902 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-01-31 16:54:17,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:17,902 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-31 16:54:17,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 16:54:17,902 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-31 16:54:17,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-31 16:54:17,903 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:17,903 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-01-31 16:54:17,903 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:17,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:17,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-01-31 16:54:17,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:17,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:17,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:17,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:17,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:18,087 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:18,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:18,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:18,087 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:18,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:18,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:18,088 INFO 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 16:54:18,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:18,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:18,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:18,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:18,393 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:18,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:18,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-31 16:54:18,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:18,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 16:54:18,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 16:54:18,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-31 16:54:18,415 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-01-31 16:54:18,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:18,450 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-01-31 16:54:18,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-31 16:54:18,450 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-01-31 16:54:18,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:18,451 INFO L225 Difference]: With dead ends: 17 [2019-01-31 16:54:18,451 INFO L226 Difference]: Without dead ends: 15 [2019-01-31 16:54:18,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-31 16:54:18,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-31 16:54:18,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-31 16:54:18,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-31 16:54:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-01-31 16:54:18,455 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-01-31 16:54:18,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:18,455 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-01-31 16:54:18,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 16:54:18,455 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-01-31 16:54:18,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-31 16:54:18,456 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:18,456 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-01-31 16:54:18,456 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:18,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:18,456 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-01-31 16:54:18,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:18,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:18,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:18,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:18,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:18,718 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:18,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:18,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:18,718 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:18,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:18,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:18,719 INFO 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 16:54:18,735 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:18,735 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:18,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-31 16:54:18,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:18,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:18,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:19,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:19,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-01-31 16:54:19,215 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:19,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-31 16:54:19,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-31 16:54:19,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-31 16:54:19,217 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-01-31 16:54:19,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:19,252 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-01-31 16:54:19,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-31 16:54:19,257 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-01-31 16:54:19,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:19,258 INFO L225 Difference]: With dead ends: 18 [2019-01-31 16:54:19,258 INFO L226 Difference]: Without dead ends: 16 [2019-01-31 16:54:19,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-31 16:54:19,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-31 16:54:19,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-31 16:54:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-31 16:54:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-31 16:54:19,261 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-01-31 16:54:19,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:19,262 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-31 16:54:19,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-31 16:54:19,262 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-31 16:54:19,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-31 16:54:19,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:19,262 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-01-31 16:54:19,263 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:19,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:19,263 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-01-31 16:54:19,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:19,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:19,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:19,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:19,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:19,416 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:19,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:19,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:19,417 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:19,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:19,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:19,417 INFO 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 16:54:19,426 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:19,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:19,439 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:19,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:19,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:19,450 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:19,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:19,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:19,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-31 16:54:19,727 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:19,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-31 16:54:19,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-31 16:54:19,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-31 16:54:19,729 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-01-31 16:54:19,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:19,843 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-01-31 16:54:19,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-31 16:54:19,843 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-01-31 16:54:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:19,844 INFO L225 Difference]: With dead ends: 19 [2019-01-31 16:54:19,844 INFO L226 Difference]: Without dead ends: 17 [2019-01-31 16:54:19,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 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 16:54:19,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-31 16:54:19,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-31 16:54:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-31 16:54:19,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-31 16:54:19,848 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-01-31 16:54:19,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:19,849 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-31 16:54:19,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-31 16:54:19,849 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-31 16:54:19,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-31 16:54:19,849 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:19,849 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-01-31 16:54:19,850 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:19,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:19,850 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-01-31 16:54:19,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:19,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:19,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:19,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:19,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:20,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:20,015 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:20,015 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:20,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:20,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:20,015 INFO 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 16:54:20,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:20,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:20,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:20,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:20,422 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:20,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:20,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-31 16:54:20,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:20,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-31 16:54:20,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-31 16:54:20,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-31 16:54:20,450 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-01-31 16:54:20,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:20,482 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-31 16:54:20,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-31 16:54:20,493 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-01-31 16:54:20,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:20,494 INFO L225 Difference]: With dead ends: 20 [2019-01-31 16:54:20,494 INFO L226 Difference]: Without dead ends: 18 [2019-01-31 16:54:20,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-31 16:54:20,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-31 16:54:20,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-31 16:54:20,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-31 16:54:20,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-31 16:54:20,499 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-01-31 16:54:20,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:20,500 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-31 16:54:20,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-31 16:54:20,500 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-31 16:54:20,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-31 16:54:20,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:20,500 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-01-31 16:54:20,501 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:20,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:20,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-01-31 16:54:20,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:20,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:20,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:20,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:20,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:21,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:21,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:21,131 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:21,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:21,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:21,132 INFO 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 16:54:21,140 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:21,140 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:21,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-31 16:54:21,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:21,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:21,168 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:21,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:21,599 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:21,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:21,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-01-31 16:54:21,619 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:21,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-31 16:54:21,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-31 16:54:21,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-31 16:54:21,621 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-01-31 16:54:21,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:21,651 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-01-31 16:54:21,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-31 16:54:21,651 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-01-31 16:54:21,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:21,652 INFO L225 Difference]: With dead ends: 21 [2019-01-31 16:54:21,653 INFO L226 Difference]: Without dead ends: 19 [2019-01-31 16:54:21,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-31 16:54:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-31 16:54:21,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-31 16:54:21,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-31 16:54:21,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-01-31 16:54:21,657 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-01-31 16:54:21,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:21,658 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-01-31 16:54:21,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-31 16:54:21,658 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-01-31 16:54:21,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-31 16:54:21,658 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:21,659 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-01-31 16:54:21,659 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:21,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:21,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-01-31 16:54:21,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:21,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:21,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:21,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:21,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:21,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:21,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:21,916 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:21,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 16:54:21,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:21,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 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 16:54:21,926 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:21,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:21,939 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:21,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:21,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:21,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:22,614 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:22,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:22,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-31 16:54:22,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:22,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-31 16:54:22,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-31 16:54:22,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-31 16:54:22,636 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-01-31 16:54:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:22,692 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-31 16:54:22,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-31 16:54:22,692 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-01-31 16:54:22,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:22,693 INFO L225 Difference]: With dead ends: 22 [2019-01-31 16:54:22,693 INFO L226 Difference]: Without dead ends: 20 [2019-01-31 16:54:22,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-31 16:54:22,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-31 16:54:22,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-31 16:54:22,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-31 16:54:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-01-31 16:54:22,698 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-01-31 16:54:22,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:22,698 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-01-31 16:54:22,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-31 16:54:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-01-31 16:54:22,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-31 16:54:22,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:22,699 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-01-31 16:54:22,699 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:22,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:22,700 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-01-31 16:54:22,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:22,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:22,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:22,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:22,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:23,371 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:23,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:23,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:23,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:23,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:23,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:23,373 INFO 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 16:54:23,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:23,392 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:23,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:23,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:24,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:24,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-31 16:54:24,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:24,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-31 16:54:24,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-31 16:54:24,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-31 16:54:24,072 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-01-31 16:54:24,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:24,099 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-01-31 16:54:24,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-31 16:54:24,101 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-01-31 16:54:24,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:24,101 INFO L225 Difference]: With dead ends: 23 [2019-01-31 16:54:24,101 INFO L226 Difference]: Without dead ends: 21 [2019-01-31 16:54:24,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-31 16:54:24,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-31 16:54:24,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-31 16:54:24,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-31 16:54:24,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-31 16:54:24,105 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-01-31 16:54:24,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:24,106 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-31 16:54:24,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-31 16:54:24,106 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-31 16:54:24,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-31 16:54:24,106 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:24,106 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-01-31 16:54:24,106 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:24,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:24,107 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-01-31 16:54:24,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:24,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:24,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:24,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:24,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:24,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:24,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:24,291 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:24,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:24,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:24,291 INFO 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 16:54:24,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:24,300 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:24,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-31 16:54:24,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:24,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:24,330 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:24,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:25,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:25,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-31 16:54:25,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:25,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-31 16:54:25,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-31 16:54:25,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-31 16:54:25,231 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-01-31 16:54:25,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:25,267 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-31 16:54:25,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-31 16:54:25,269 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-01-31 16:54:25,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:25,270 INFO L225 Difference]: With dead ends: 24 [2019-01-31 16:54:25,270 INFO L226 Difference]: Without dead ends: 22 [2019-01-31 16:54:25,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-31 16:54:25,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-31 16:54:25,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-31 16:54:25,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-31 16:54:25,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-31 16:54:25,275 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-01-31 16:54:25,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:25,275 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-31 16:54:25,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-31 16:54:25,275 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-31 16:54:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-31 16:54:25,276 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:25,276 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-01-31 16:54:25,276 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:25,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:25,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-01-31 16:54:25,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:25,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:25,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:25,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:25,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:26,680 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:26,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:26,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:26,680 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:26,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:26,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:26,681 INFO 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 16:54:26,688 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:26,689 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:26,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:26,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:26,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:26,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:27,126 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:27,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:27,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-31 16:54:27,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:27,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-31 16:54:27,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-31 16:54:27,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-31 16:54:27,149 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-01-31 16:54:27,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:27,187 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-31 16:54:27,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-31 16:54:27,187 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-01-31 16:54:27,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:27,188 INFO L225 Difference]: With dead ends: 25 [2019-01-31 16:54:27,188 INFO L226 Difference]: Without dead ends: 23 [2019-01-31 16:54:27,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-31 16:54:27,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-31 16:54:27,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-31 16:54:27,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-31 16:54:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-01-31 16:54:27,193 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-01-31 16:54:27,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:27,194 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-01-31 16:54:27,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-31 16:54:27,194 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-01-31 16:54:27,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-31 16:54:27,194 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:27,194 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-01-31 16:54:27,195 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:27,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:27,195 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-01-31 16:54:27,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:27,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:27,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:27,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:27,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:27,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:27,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:27,446 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:27,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:27,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:27,447 INFO 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 16:54:27,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:27,457 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:27,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:27,478 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:27,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:28,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:28,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-31 16:54:28,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:28,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-31 16:54:28,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-31 16:54:28,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-31 16:54:28,220 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-01-31 16:54:28,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:28,321 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-31 16:54:28,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-31 16:54:28,323 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-01-31 16:54:28,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:28,324 INFO L225 Difference]: With dead ends: 26 [2019-01-31 16:54:28,324 INFO L226 Difference]: Without dead ends: 24 [2019-01-31 16:54:28,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-31 16:54:28,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-31 16:54:28,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-31 16:54:28,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-31 16:54:28,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-31 16:54:28,328 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-01-31 16:54:28,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:28,328 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-31 16:54:28,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-31 16:54:28,328 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-31 16:54:28,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-31 16:54:28,329 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:28,329 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-01-31 16:54:28,329 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:28,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:28,330 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-01-31 16:54:28,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:28,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:28,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:28,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:28,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:28,584 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:28,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:28,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:28,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:28,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:28,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:28,585 INFO 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 16:54:28,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:28,594 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:28,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-31 16:54:28,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:28,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:28,631 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:28,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:29,136 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:29,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:29,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-31 16:54:29,155 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:29,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-31 16:54:29,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-31 16:54:29,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-31 16:54:29,157 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-01-31 16:54:29,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:29,220 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-31 16:54:29,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-31 16:54:29,220 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-01-31 16:54:29,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:29,221 INFO L225 Difference]: With dead ends: 27 [2019-01-31 16:54:29,221 INFO L226 Difference]: Without dead ends: 25 [2019-01-31 16:54:29,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 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 16:54:29,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-31 16:54:29,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-31 16:54:29,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-31 16:54:29,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-01-31 16:54:29,226 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-01-31 16:54:29,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:29,227 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-01-31 16:54:29,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-31 16:54:29,227 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-01-31 16:54:29,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-31 16:54:29,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:29,228 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-01-31 16:54:29,228 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:29,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:29,228 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-01-31 16:54:29,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:29,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:29,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:29,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:29,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:29,641 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:29,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:29,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:29,641 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:29,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 16:54:29,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:29,642 INFO 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 16:54:29,651 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:29,651 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:29,666 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:29,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:29,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:29,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:30,213 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:30,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:30,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-31 16:54:30,232 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:30,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-31 16:54:30,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-31 16:54:30,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-31 16:54:30,234 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-01-31 16:54:30,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:30,290 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-31 16:54:30,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-31 16:54:30,293 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-01-31 16:54:30,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:30,294 INFO L225 Difference]: With dead ends: 28 [2019-01-31 16:54:30,294 INFO L226 Difference]: Without dead ends: 26 [2019-01-31 16:54:30,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 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 16:54:30,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-31 16:54:30,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-31 16:54:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-31 16:54:30,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-31 16:54:30,298 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-01-31 16:54:30,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:30,299 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-31 16:54:30,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-31 16:54:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-31 16:54:30,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-31 16:54:30,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:30,300 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-01-31 16:54:30,300 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:30,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:30,300 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-01-31 16:54:30,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:30,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:30,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:30,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:30,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:30,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:30,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:30,644 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:30,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 16:54:30,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:30,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 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 16:54:30,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:30,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:30,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:30,677 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:30,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:31,407 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:31,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:31,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-31 16:54:31,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:31,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-31 16:54:31,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-31 16:54:31,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-31 16:54:31,429 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-01-31 16:54:31,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:31,464 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-01-31 16:54:31,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-31 16:54:31,464 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-01-31 16:54:31,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:31,465 INFO L225 Difference]: With dead ends: 29 [2019-01-31 16:54:31,465 INFO L226 Difference]: Without dead ends: 27 [2019-01-31 16:54:31,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-31 16:54:31,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-31 16:54:31,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-31 16:54:31,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-31 16:54:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-01-31 16:54:31,470 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-01-31 16:54:31,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:31,471 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-01-31 16:54:31,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-31 16:54:31,471 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-01-31 16:54:31,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-31 16:54:31,471 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:31,471 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-01-31 16:54:31,472 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:31,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:31,472 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-01-31 16:54:31,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:31,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:31,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:31,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:31,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:31,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:31,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:31,867 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:31,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:31,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:31,867 INFO 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 16:54:31,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:31,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:31,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-31 16:54:31,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:31,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:31,921 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:31,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:33,164 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:33,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:33,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-01-31 16:54:33,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:33,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-31 16:54:33,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-31 16:54:33,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-31 16:54:33,185 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-01-31 16:54:33,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:33,234 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-31 16:54:33,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-31 16:54:33,234 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-01-31 16:54:33,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:33,235 INFO L225 Difference]: With dead ends: 30 [2019-01-31 16:54:33,235 INFO L226 Difference]: Without dead ends: 28 [2019-01-31 16:54:33,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-31 16:54:33,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-31 16:54:33,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-31 16:54:33,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-31 16:54:33,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-31 16:54:33,242 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-01-31 16:54:33,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:33,242 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-31 16:54:33,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-31 16:54:33,242 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-31 16:54:33,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-31 16:54:33,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:33,243 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-01-31 16:54:33,243 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:33,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:33,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-01-31 16:54:33,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:33,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:33,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:33,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:33,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:33,680 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:33,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:33,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:33,680 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:33,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:33,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:33,681 INFO 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 16:54:33,690 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:33,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:33,705 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:33,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:33,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:33,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:34,485 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:34,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:34,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-31 16:54:34,506 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:34,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-31 16:54:34,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-31 16:54:34,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-31 16:54:34,508 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-01-31 16:54:34,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:34,562 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-31 16:54:34,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-31 16:54:34,563 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-01-31 16:54:34,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:34,563 INFO L225 Difference]: With dead ends: 31 [2019-01-31 16:54:34,563 INFO L226 Difference]: Without dead ends: 29 [2019-01-31 16:54:34,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-31 16:54:34,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-31 16:54:34,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-31 16:54:34,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-31 16:54:34,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-31 16:54:34,569 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-01-31 16:54:34,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:34,569 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-31 16:54:34,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-31 16:54:34,569 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-31 16:54:34,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-31 16:54:34,572 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:34,572 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-01-31 16:54:34,572 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:34,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:34,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-01-31 16:54:34,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:34,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:34,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:34,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:34,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:34,891 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:34,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:34,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:34,892 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:34,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:34,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:34,892 INFO 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 16:54:34,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:34,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:34,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:34,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:36,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:36,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-31 16:54:36,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:36,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-31 16:54:36,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-31 16:54:36,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-31 16:54:36,166 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-01-31 16:54:36,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:36,263 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-31 16:54:36,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-31 16:54:36,263 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-01-31 16:54:36,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:36,264 INFO L225 Difference]: With dead ends: 32 [2019-01-31 16:54:36,264 INFO L226 Difference]: Without dead ends: 30 [2019-01-31 16:54:36,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-31 16:54:36,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-31 16:54:36,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-31 16:54:36,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-31 16:54:36,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-31 16:54:36,268 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-01-31 16:54:36,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:36,268 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-31 16:54:36,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-31 16:54:36,268 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-31 16:54:36,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-31 16:54:36,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:36,269 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-01-31 16:54:36,269 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:36,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:36,270 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-01-31 16:54:36,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:36,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:36,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:36,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:36,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:36,948 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:36,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:36,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:36,948 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:36,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:36,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:36,949 INFO 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 16:54:36,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:36,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:37,001 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-31 16:54:37,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:37,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:37,011 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:37,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:38,194 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:38,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:38,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-01-31 16:54:38,212 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:38,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-31 16:54:38,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-31 16:54:38,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-31 16:54:38,214 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-01-31 16:54:38,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:38,376 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-31 16:54:38,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-31 16:54:38,377 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-01-31 16:54:38,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:38,378 INFO L225 Difference]: With dead ends: 33 [2019-01-31 16:54:38,378 INFO L226 Difference]: Without dead ends: 31 [2019-01-31 16:54:38,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-31 16:54:38,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-31 16:54:38,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-31 16:54:38,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-31 16:54:38,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-31 16:54:38,381 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-01-31 16:54:38,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:38,381 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-31 16:54:38,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-31 16:54:38,382 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-31 16:54:38,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-31 16:54:38,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:38,382 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-01-31 16:54:38,382 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:38,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:38,383 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-01-31 16:54:38,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:38,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:38,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:38,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:38,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:39,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:39,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:39,222 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:39,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:39,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:39,223 INFO 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 16:54:39,234 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:39,234 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:39,252 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:39,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:39,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:39,262 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:39,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:40,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:40,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-31 16:54:40,113 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:40,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-31 16:54:40,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-31 16:54:40,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-31 16:54:40,115 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-01-31 16:54:40,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:40,147 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-01-31 16:54:40,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-31 16:54:40,148 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-01-31 16:54:40,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:40,148 INFO L225 Difference]: With dead ends: 34 [2019-01-31 16:54:40,148 INFO L226 Difference]: Without dead ends: 32 [2019-01-31 16:54:40,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-31 16:54:40,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-31 16:54:40,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-31 16:54:40,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-31 16:54:40,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-31 16:54:40,154 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-01-31 16:54:40,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:40,154 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-31 16:54:40,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-31 16:54:40,155 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-31 16:54:40,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-31 16:54:40,155 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:40,155 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-01-31 16:54:40,155 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:40,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:40,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-01-31 16:54:40,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:40,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:40,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:40,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:40,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:40,593 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:40,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:40,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:40,593 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:40,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:40,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:40,594 INFO 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 16:54:40,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:40,602 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:40,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:40,631 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:40,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:41,636 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:41,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:41,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-31 16:54:41,657 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:41,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-31 16:54:41,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-31 16:54:41,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-31 16:54:41,658 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-01-31 16:54:41,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:41,773 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-31 16:54:41,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-31 16:54:41,773 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-01-31 16:54:41,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:41,774 INFO L225 Difference]: With dead ends: 35 [2019-01-31 16:54:41,774 INFO L226 Difference]: Without dead ends: 33 [2019-01-31 16:54:41,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-31 16:54:41,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-31 16:54:41,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-31 16:54:41,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-31 16:54:41,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-01-31 16:54:41,782 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-01-31 16:54:41,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:41,782 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-01-31 16:54:41,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-31 16:54:41,782 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-01-31 16:54:41,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-31 16:54:41,783 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:41,783 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-01-31 16:54:41,783 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:41,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:41,784 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-01-31 16:54:41,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:41,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:41,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:41,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:41,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:42,346 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:42,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:42,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:42,347 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:42,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:42,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:42,348 INFO 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 16:54:42,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:42,357 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:42,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-31 16:54:42,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:42,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:42,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:43,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:43,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-01-31 16:54:43,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:43,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-31 16:54:43,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-31 16:54:43,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-31 16:54:43,744 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-01-31 16:54:43,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:43,793 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-31 16:54:43,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-31 16:54:43,794 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-01-31 16:54:43,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:43,794 INFO L225 Difference]: With dead ends: 36 [2019-01-31 16:54:43,795 INFO L226 Difference]: Without dead ends: 34 [2019-01-31 16:54:43,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-31 16:54:43,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-31 16:54:43,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-31 16:54:43,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-31 16:54:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-31 16:54:43,798 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-01-31 16:54:43,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:43,798 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-31 16:54:43,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-31 16:54:43,798 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-31 16:54:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-31 16:54:43,798 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:43,798 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-01-31 16:54:43,799 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:43,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:43,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-01-31 16:54:43,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:43,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:43,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:43,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:43,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:44,317 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:44,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:44,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:44,318 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:44,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:44,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:44,318 INFO 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 16:54:44,330 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:44,330 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:44,352 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:44,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:44,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:44,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:45,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:45,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-31 16:54:45,467 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:45,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-31 16:54:45,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-31 16:54:45,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-31 16:54:45,469 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-01-31 16:54:45,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:45,564 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-01-31 16:54:45,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-31 16:54:45,564 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-01-31 16:54:45,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:45,565 INFO L225 Difference]: With dead ends: 37 [2019-01-31 16:54:45,565 INFO L226 Difference]: Without dead ends: 35 [2019-01-31 16:54:45,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-31 16:54:45,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-31 16:54:45,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-31 16:54:45,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-31 16:54:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-01-31 16:54:45,568 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-01-31 16:54:45,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:45,568 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-01-31 16:54:45,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-31 16:54:45,569 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-01-31 16:54:45,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-31 16:54:45,569 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:45,569 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-01-31 16:54:45,569 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:45,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:45,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-01-31 16:54:45,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:45,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:45,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:45,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:45,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:46,141 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:46,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:46,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:46,141 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:46,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:46,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:46,142 INFO 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 16:54:46,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:46,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:46,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:46,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:47,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:47,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-31 16:54:47,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:47,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-31 16:54:47,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-31 16:54:47,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-31 16:54:47,277 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-01-31 16:54:47,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:47,345 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-31 16:54:47,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-31 16:54:47,345 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-01-31 16:54:47,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:47,346 INFO L225 Difference]: With dead ends: 38 [2019-01-31 16:54:47,346 INFO L226 Difference]: Without dead ends: 36 [2019-01-31 16:54:47,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-31 16:54:47,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-31 16:54:47,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-31 16:54:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-31 16:54:47,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-31 16:54:47,349 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-01-31 16:54:47,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:47,349 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-31 16:54:47,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-31 16:54:47,349 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-31 16:54:47,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-31 16:54:47,350 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:47,350 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-01-31 16:54:47,350 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:47,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:47,350 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-01-31 16:54:47,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:47,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:47,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:47,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:47,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:47,869 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:47,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:47,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:47,870 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:47,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:47,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:47,870 INFO 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 16:54:47,878 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:47,878 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:47,939 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-31 16:54:47,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:47,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:47,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:49,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:49,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-31 16:54:49,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:49,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-31 16:54:49,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-31 16:54:49,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-31 16:54:49,292 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-01-31 16:54:49,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:49,375 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-31 16:54:49,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-31 16:54:49,375 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-01-31 16:54:49,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:49,376 INFO L225 Difference]: With dead ends: 39 [2019-01-31 16:54:49,376 INFO L226 Difference]: Without dead ends: 37 [2019-01-31 16:54:49,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-31 16:54:49,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-31 16:54:49,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-31 16:54:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-31 16:54:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-31 16:54:49,380 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-01-31 16:54:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:49,380 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-31 16:54:49,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-31 16:54:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-31 16:54:49,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-31 16:54:49,381 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:49,381 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-01-31 16:54:49,381 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:49,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:49,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-01-31 16:54:49,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:49,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:49,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:49,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:49,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:49,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:49,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:49,922 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:49,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:49,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:49,923 INFO 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 16:54:49,932 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:49,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:49,956 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:49,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:49,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:49,965 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:49,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:51,204 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:51,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:51,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-31 16:54:51,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:51,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-31 16:54:51,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-31 16:54:51,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-31 16:54:51,225 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-01-31 16:54:51,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:51,330 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-31 16:54:51,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-31 16:54:51,330 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-01-31 16:54:51,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:51,331 INFO L225 Difference]: With dead ends: 40 [2019-01-31 16:54:51,331 INFO L226 Difference]: Without dead ends: 38 [2019-01-31 16:54:51,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-31 16:54:51,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-31 16:54:51,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-31 16:54:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-31 16:54:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-01-31 16:54:51,335 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-01-31 16:54:51,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:51,335 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-01-31 16:54:51,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-31 16:54:51,335 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-01-31 16:54:51,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-31 16:54:51,336 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:51,336 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-01-31 16:54:51,336 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:51,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:51,336 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-01-31 16:54:51,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:51,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:51,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:51,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:51,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:51,843 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:51,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:51,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:51,844 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:51,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:51,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:51,844 INFO 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 16:54:51,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:51,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:51,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:51,897 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:51,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:53,508 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:53,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:53,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-31 16:54:53,527 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:53,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-31 16:54:53,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-31 16:54:53,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-31 16:54:53,528 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-01-31 16:54:53,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:53,594 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-31 16:54:53,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-31 16:54:53,595 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-01-31 16:54:53,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:53,596 INFO L225 Difference]: With dead ends: 41 [2019-01-31 16:54:53,596 INFO L226 Difference]: Without dead ends: 39 [2019-01-31 16:54:53,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 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 16:54:53,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-31 16:54:53,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-31 16:54:53,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-31 16:54:53,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-01-31 16:54:53,600 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-01-31 16:54:53,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:53,600 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-01-31 16:54:53,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-31 16:54:53,600 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-01-31 16:54:53,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-31 16:54:53,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:53,601 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-01-31 16:54:53,601 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:53,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:53,602 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-01-31 16:54:53,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:53,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:53,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:53,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:53,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:54,173 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:54,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:54,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:54,174 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:54,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:54,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:54,174 INFO 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 16:54:54,182 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:54,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:54,263 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-31 16:54:54,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:54,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:54,273 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:54,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:55,601 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:55,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:55,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-31 16:54:55,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:55,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-31 16:54:55,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-31 16:54:55,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-31 16:54:55,622 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-01-31 16:54:55,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:55,671 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-31 16:54:55,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-31 16:54:55,671 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-01-31 16:54:55,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:55,672 INFO L225 Difference]: With dead ends: 42 [2019-01-31 16:54:55,672 INFO L226 Difference]: Without dead ends: 40 [2019-01-31 16:54:55,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-31 16:54:55,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-31 16:54:55,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-31 16:54:55,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-31 16:54:55,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-31 16:54:55,675 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-01-31 16:54:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:55,675 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-31 16:54:55,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-31 16:54:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-31 16:54:55,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-31 16:54:55,676 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:55,676 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-01-31 16:54:55,676 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:55,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:55,676 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-01-31 16:54:55,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:55,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:55,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:55,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:55,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:56,391 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:56,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:56,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:56,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:56,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:56,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:56,392 INFO 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 16:54:56,400 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:56,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:56,432 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:56,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:56,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:56,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:58,137 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:58,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:58,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-31 16:54:58,156 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:58,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-31 16:54:58,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-31 16:54:58,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-31 16:54:58,157 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-01-31 16:54:58,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:58,236 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-01-31 16:54:58,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-31 16:54:58,237 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-01-31 16:54:58,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:58,237 INFO L225 Difference]: With dead ends: 43 [2019-01-31 16:54:58,237 INFO L226 Difference]: Without dead ends: 41 [2019-01-31 16:54:58,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-31 16:54:58,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-31 16:54:58,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-31 16:54:58,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-31 16:54:58,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-31 16:54:58,239 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-01-31 16:54:58,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:58,239 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-31 16:54:58,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-31 16:54:58,240 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-31 16:54:58,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-31 16:54:58,240 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:58,241 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-01-31 16:54:58,241 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:58,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-01-31 16:54:58,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:58,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:58,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:58,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:58,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:59,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:59,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:59,511 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:59,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 16:54:59,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:59,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 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 16:54:59,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:59,521 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:59,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:59,567 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:59,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:01,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:01,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-31 16:55:01,083 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:01,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-31 16:55:01,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-31 16:55:01,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-31 16:55:01,084 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-01-31 16:55:01,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:01,150 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-01-31 16:55:01,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-31 16:55:01,150 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-01-31 16:55:01,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:01,151 INFO L225 Difference]: With dead ends: 44 [2019-01-31 16:55:01,151 INFO L226 Difference]: Without dead ends: 42 [2019-01-31 16:55:01,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-31 16:55:01,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-31 16:55:01,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-31 16:55:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-31 16:55:01,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-31 16:55:01,153 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-01-31 16:55:01,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:01,153 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-31 16:55:01,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-31 16:55:01,153 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-31 16:55:01,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-31 16:55:01,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:01,154 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-01-31 16:55:01,155 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:01,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:01,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-01-31 16:55:01,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:01,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:01,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:01,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:01,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:01,843 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:01,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:01,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:01,844 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:01,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:01,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:01,844 INFO 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 16:55:01,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:01,854 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:01,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-31 16:55:01,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:01,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:01,952 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:01,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:03,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:03,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-31 16:55:03,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:03,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-31 16:55:03,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-31 16:55:03,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-31 16:55:03,779 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-01-31 16:55:03,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:03,842 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-31 16:55:03,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-31 16:55:03,842 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-01-31 16:55:03,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:03,843 INFO L225 Difference]: With dead ends: 45 [2019-01-31 16:55:03,843 INFO L226 Difference]: Without dead ends: 43 [2019-01-31 16:55:03,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-31 16:55:03,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-31 16:55:03,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-31 16:55:03,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-31 16:55:03,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-01-31 16:55:03,846 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-01-31 16:55:03,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:03,846 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-01-31 16:55:03,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-31 16:55:03,847 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-01-31 16:55:03,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-31 16:55:03,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:03,847 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-01-31 16:55:03,847 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:03,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:03,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-01-31 16:55:03,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:03,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:03,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:03,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:03,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:04,617 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:04,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:04,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:04,617 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:04,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:04,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:04,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:55:04,626 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:04,626 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:04,652 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:04,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:04,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:04,660 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:04,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:06,347 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:06,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:06,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-31 16:55:06,366 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:06,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-31 16:55:06,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-31 16:55:06,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-31 16:55:06,367 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-01-31 16:55:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:06,432 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-31 16:55:06,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-31 16:55:06,433 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-01-31 16:55:06,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:06,434 INFO L225 Difference]: With dead ends: 46 [2019-01-31 16:55:06,434 INFO L226 Difference]: Without dead ends: 44 [2019-01-31 16:55:06,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-31 16:55:06,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-31 16:55:06,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-31 16:55:06,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-31 16:55:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-31 16:55:06,437 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-01-31 16:55:06,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:06,437 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-31 16:55:06,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-31 16:55:06,437 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-31 16:55:06,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-31 16:55:06,437 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:06,437 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-01-31 16:55:06,438 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:06,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:06,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-01-31 16:55:06,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:06,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:06,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:06,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:06,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:07,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:07,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:07,163 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:07,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:07,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:07,164 INFO 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 16:55:07,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:07,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:07,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:07,228 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:07,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:09,355 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:09,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:09,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-31 16:55:09,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:09,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-31 16:55:09,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-31 16:55:09,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-31 16:55:09,374 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-01-31 16:55:09,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:09,473 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-31 16:55:09,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-31 16:55:09,474 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-01-31 16:55:09,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:09,475 INFO L225 Difference]: With dead ends: 47 [2019-01-31 16:55:09,475 INFO L226 Difference]: Without dead ends: 45 [2019-01-31 16:55:09,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-31 16:55:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-31 16:55:09,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-31 16:55:09,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-31 16:55:09,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-31 16:55:09,478 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-01-31 16:55:09,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:09,478 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-31 16:55:09,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-31 16:55:09,478 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-31 16:55:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-31 16:55:09,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:09,478 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-01-31 16:55:09,479 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:09,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:09,479 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-01-31 16:55:09,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:09,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:09,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:09,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:09,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:10,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:10,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:10,239 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:10,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:10,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:10,239 INFO 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 16:55:10,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:10,248 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:10,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-31 16:55:10,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:10,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:10,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:12,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:12,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-31 16:55:12,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:12,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-31 16:55:12,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-31 16:55:12,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-31 16:55:12,283 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-01-31 16:55:12,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:12,354 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-31 16:55:12,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-31 16:55:12,355 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-01-31 16:55:12,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:12,356 INFO L225 Difference]: With dead ends: 48 [2019-01-31 16:55:12,356 INFO L226 Difference]: Without dead ends: 46 [2019-01-31 16:55:12,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-31 16:55:12,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-31 16:55:12,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-31 16:55:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-31 16:55:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-31 16:55:12,359 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-01-31 16:55:12,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:12,360 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-31 16:55:12,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-31 16:55:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-31 16:55:12,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-31 16:55:12,361 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:12,361 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-01-31 16:55:12,361 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:12,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:12,361 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-01-31 16:55:12,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:12,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:12,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:12,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:12,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:13,282 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:13,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:13,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:13,283 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:13,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:13,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:13,283 INFO 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 16:55:13,292 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:13,292 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:13,321 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:13,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:13,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:13,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:15,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:15,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-31 16:55:15,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:15,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-31 16:55:15,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-31 16:55:15,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-31 16:55:15,739 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-01-31 16:55:15,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:15,790 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-31 16:55:15,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-31 16:55:15,790 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-01-31 16:55:15,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:15,791 INFO L225 Difference]: With dead ends: 49 [2019-01-31 16:55:15,791 INFO L226 Difference]: Without dead ends: 47 [2019-01-31 16:55:15,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-31 16:55:15,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-31 16:55:15,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-31 16:55:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-31 16:55:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-31 16:55:15,795 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-01-31 16:55:15,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:15,795 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-31 16:55:15,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-31 16:55:15,795 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-31 16:55:15,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-31 16:55:15,795 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:15,795 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-01-31 16:55:15,796 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:15,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:15,796 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-01-31 16:55:15,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:15,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:15,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:15,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:15,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:16,711 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:16,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:16,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:16,711 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:16,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:16,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:16,712 INFO 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 16:55:16,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:16,721 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:16,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:16,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:19,187 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:19,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:19,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-31 16:55:19,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:19,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-31 16:55:19,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-31 16:55:19,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-31 16:55:19,207 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-01-31 16:55:19,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:19,279 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-31 16:55:19,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-31 16:55:19,279 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-01-31 16:55:19,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:19,280 INFO L225 Difference]: With dead ends: 50 [2019-01-31 16:55:19,280 INFO L226 Difference]: Without dead ends: 48 [2019-01-31 16:55:19,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-31 16:55:19,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-31 16:55:19,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-31 16:55:19,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-31 16:55:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-31 16:55:19,284 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-01-31 16:55:19,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:19,284 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-31 16:55:19,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-31 16:55:19,284 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-31 16:55:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-31 16:55:19,285 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:19,285 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-01-31 16:55:19,285 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:19,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:19,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-01-31 16:55:19,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:19,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:19,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:19,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:19,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:20,106 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:20,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:20,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:20,106 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:20,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:20,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:20,106 INFO 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 16:55:20,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:20,115 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:20,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-31 16:55:20,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:20,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:20,252 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:20,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:22,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:22,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-01-31 16:55:22,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:22,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-31 16:55:22,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-31 16:55:22,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-31 16:55:22,401 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-01-31 16:55:22,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:22,524 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-31 16:55:22,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-31 16:55:22,525 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-01-31 16:55:22,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:22,526 INFO L225 Difference]: With dead ends: 51 [2019-01-31 16:55:22,526 INFO L226 Difference]: Without dead ends: 49 [2019-01-31 16:55:22,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-31 16:55:22,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-31 16:55:22,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-31 16:55:22,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-31 16:55:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-31 16:55:22,531 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-01-31 16:55:22,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:22,531 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-31 16:55:22,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-31 16:55:22,531 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-31 16:55:22,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-31 16:55:22,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:22,532 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-01-31 16:55:22,532 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:22,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:22,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-01-31 16:55:22,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:22,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:22,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:22,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:22,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:23,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:23,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:23,376 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:23,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:23,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:23,376 INFO 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 16:55:23,387 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:23,387 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:23,440 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:23,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:23,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:23,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:23,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:25,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:26,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:26,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-31 16:55:26,008 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:26,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-31 16:55:26,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-31 16:55:26,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-31 16:55:26,010 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-01-31 16:55:26,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:26,332 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-31 16:55:26,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-31 16:55:26,332 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-01-31 16:55:26,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:26,333 INFO L225 Difference]: With dead ends: 52 [2019-01-31 16:55:26,333 INFO L226 Difference]: Without dead ends: 50 [2019-01-31 16:55:26,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-31 16:55:26,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-31 16:55:26,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-31 16:55:26,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-31 16:55:26,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-01-31 16:55:26,337 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-01-31 16:55:26,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:26,337 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-01-31 16:55:26,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-31 16:55:26,337 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-01-31 16:55:26,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-31 16:55:26,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:26,338 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-01-31 16:55:26,338 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:26,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:26,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-01-31 16:55:26,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:26,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:26,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:26,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:26,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:27,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:27,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:27,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:27,256 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:27,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:27,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:27,256 INFO 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 16:55:27,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:27,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:27,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:27,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:27,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:30,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:30,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:30,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-31 16:55:30,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:30,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-31 16:55:30,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-31 16:55:30,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-31 16:55:30,028 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-01-31 16:55:30,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:30,121 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-31 16:55:30,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-31 16:55:30,122 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-01-31 16:55:30,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:30,123 INFO L225 Difference]: With dead ends: 53 [2019-01-31 16:55:30,123 INFO L226 Difference]: Without dead ends: 51 [2019-01-31 16:55:30,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 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 16:55:30,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-31 16:55:30,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-31 16:55:30,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-31 16:55:30,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-31 16:55:30,126 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-01-31 16:55:30,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:30,127 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-31 16:55:30,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-31 16:55:30,127 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-31 16:55:30,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-31 16:55:30,127 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:30,128 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-01-31 16:55:30,128 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:30,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:30,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-01-31 16:55:30,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:30,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:30,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:30,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:30,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:31,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:31,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:31,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:31,401 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:31,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:31,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:31,401 INFO 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 16:55:31,409 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:31,409 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:31,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-31 16:55:31,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:31,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:31,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:31,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:33,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:33,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:33,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-31 16:55:33,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:33,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-31 16:55:33,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-31 16:55:33,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-31 16:55:33,982 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-01-31 16:55:34,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:34,043 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-31 16:55:34,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-31 16:55:34,044 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-01-31 16:55:34,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:34,045 INFO L225 Difference]: With dead ends: 54 [2019-01-31 16:55:34,045 INFO L226 Difference]: Without dead ends: 52 [2019-01-31 16:55:34,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-31 16:55:34,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-31 16:55:34,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-31 16:55:34,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-31 16:55:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-31 16:55:34,048 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-01-31 16:55:34,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:34,048 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-31 16:55:34,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-31 16:55:34,048 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-31 16:55:34,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-31 16:55:34,049 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:34,049 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-01-31 16:55:34,049 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:34,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:34,050 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-01-31 16:55:34,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:34,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:34,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:34,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:34,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:35,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:35,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:35,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:35,178 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:35,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:35,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:35,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 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 16:55:35,186 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:35,186 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:35,217 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:35,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:35,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:35,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:37,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:37,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:37,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-31 16:55:37,713 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:37,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-31 16:55:37,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-31 16:55:37,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-31 16:55:37,715 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-01-31 16:55:37,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:37,853 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-31 16:55:37,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-31 16:55:37,853 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-01-31 16:55:37,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:37,854 INFO L225 Difference]: With dead ends: 55 [2019-01-31 16:55:37,854 INFO L226 Difference]: Without dead ends: 53 [2019-01-31 16:55:37,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-31 16:55:37,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-31 16:55:37,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-31 16:55:37,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-31 16:55:37,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-31 16:55:37,858 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-01-31 16:55:37,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:37,858 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-31 16:55:37,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-31 16:55:37,858 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-31 16:55:37,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-31 16:55:37,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:37,859 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-01-31 16:55:37,859 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:37,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:37,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-01-31 16:55:37,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:37,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:37,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:37,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:37,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:38,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:38,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:38,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:38,943 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:38,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:38,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:38,944 INFO 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 16:55:38,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:38,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:38,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:38,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:39,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:41,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:41,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:41,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-31 16:55:41,842 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:41,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-31 16:55:41,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-31 16:55:41,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-31 16:55:41,843 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-01-31 16:55:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:41,905 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-31 16:55:41,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-31 16:55:41,905 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-01-31 16:55:41,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:41,906 INFO L225 Difference]: With dead ends: 56 [2019-01-31 16:55:41,906 INFO L226 Difference]: Without dead ends: 54 [2019-01-31 16:55:41,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-31 16:55:41,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-31 16:55:41,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-31 16:55:41,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-31 16:55:41,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-01-31 16:55:41,909 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-01-31 16:55:41,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:41,909 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-01-31 16:55:41,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-31 16:55:41,909 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-01-31 16:55:41,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-31 16:55:41,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:41,910 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-01-31 16:55:41,910 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:41,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:41,910 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-01-31 16:55:41,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:41,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:41,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:41,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:41,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:42,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:42,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:42,906 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:42,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:42,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:42,906 INFO 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 16:55:42,915 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:42,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:43,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-31 16:55:43,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:43,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:43,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:43,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:46,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:46,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-31 16:55:46,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:46,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-31 16:55:46,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-31 16:55:46,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-31 16:55:46,289 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-01-31 16:55:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:46,440 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-01-31 16:55:46,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-31 16:55:46,441 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-01-31 16:55:46,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:46,442 INFO L225 Difference]: With dead ends: 57 [2019-01-31 16:55:46,442 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 16:55:46,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 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 16:55:46,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 16:55:46,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-31 16:55:46,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-31 16:55:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-01-31 16:55:46,445 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-01-31 16:55:46,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:46,445 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-01-31 16:55:46,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-31 16:55:46,445 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-01-31 16:55:46,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-31 16:55:46,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:46,446 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-01-31 16:55:46,446 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:46,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:46,446 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-01-31 16:55:46,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:46,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:46,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:46,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:46,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:47,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:47,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:47,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:47,643 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:47,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:47,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:47,643 INFO 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 16:55:47,652 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:47,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:47,686 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:47,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:47,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:47,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:47,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:50,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:50,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-31 16:55:50,911 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:50,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-31 16:55:50,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-31 16:55:50,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-31 16:55:50,913 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-01-31 16:55:51,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:51,005 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-01-31 16:55:51,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-31 16:55:51,005 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-01-31 16:55:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:51,006 INFO L225 Difference]: With dead ends: 58 [2019-01-31 16:55:51,006 INFO L226 Difference]: Without dead ends: 56 [2019-01-31 16:55:51,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-31 16:55:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-31 16:55:51,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-31 16:55:51,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-31 16:55:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-31 16:55:51,009 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-01-31 16:55:51,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:51,009 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-31 16:55:51,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-31 16:55:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-31 16:55:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-31 16:55:51,010 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:51,010 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-01-31 16:55:51,011 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:51,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:51,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-01-31 16:55:51,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:51,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:51,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:51,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:51,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:52,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:52,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:52,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:52,061 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:52,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:52,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:52,061 INFO 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 16:55:52,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:52,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:52,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:52,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:52,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:55,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:55,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:55,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-31 16:55:55,216 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:55,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-31 16:55:55,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-31 16:55:55,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-31 16:55:55,217 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-01-31 16:55:55,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:55,314 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-31 16:55:55,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-31 16:55:55,314 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-01-31 16:55:55,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:55,315 INFO L225 Difference]: With dead ends: 59 [2019-01-31 16:55:55,315 INFO L226 Difference]: Without dead ends: 57 [2019-01-31 16:55:55,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-31 16:55:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-31 16:55:55,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-31 16:55:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-31 16:55:55,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-31 16:55:55,318 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-01-31 16:55:55,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:55,318 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-31 16:55:55,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-31 16:55:55,318 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-31 16:55:55,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-31 16:55:55,319 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:55,319 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-01-31 16:55:55,319 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:55,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:55,319 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-01-31 16:55:55,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:55,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:55,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:55,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:55,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:56,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:56,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:56,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:56,561 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:56,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:56,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:56,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:56,570 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:56,571 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:56,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-31 16:55:56,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:56,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:56,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:00,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:00,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:00,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-01-31 16:56:00,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:00,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-31 16:56:00,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-31 16:56:00,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-31 16:56:00,091 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-01-31 16:56:00,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:00,160 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-31 16:56:00,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-31 16:56:00,161 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-01-31 16:56:00,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:00,162 INFO L225 Difference]: With dead ends: 60 [2019-01-31 16:56:00,162 INFO L226 Difference]: Without dead ends: 58 [2019-01-31 16:56:00,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-31 16:56:00,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-31 16:56:00,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-01-31 16:56:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-31 16:56:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-01-31 16:56:00,165 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-01-31 16:56:00,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:00,166 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-01-31 16:56:00,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-31 16:56:00,166 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-01-31 16:56:00,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-31 16:56:00,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:00,166 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-01-31 16:56:00,166 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:00,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:00,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-01-31 16:56:00,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:00,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:00,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:00,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:00,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:01,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:01,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:01,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:01,463 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:01,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:01,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:01,463 INFO 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 16:56:01,473 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:56:01,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:56:01,508 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:56:01,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:01,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:01,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:04,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:04,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:04,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-01-31 16:56:04,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:04,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-31 16:56:04,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-31 16:56:04,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-31 16:56:04,666 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-01-31 16:56:04,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:04,783 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-31 16:56:04,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-31 16:56:04,783 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-01-31 16:56:04,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:04,784 INFO L225 Difference]: With dead ends: 61 [2019-01-31 16:56:04,784 INFO L226 Difference]: Without dead ends: 59 [2019-01-31 16:56:04,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-31 16:56:04,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-31 16:56:04,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-31 16:56:04,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-31 16:56:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-01-31 16:56:04,787 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-01-31 16:56:04,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:04,787 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-01-31 16:56:04,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-31 16:56:04,787 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-01-31 16:56:04,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-31 16:56:04,788 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:04,788 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-01-31 16:56:04,788 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:04,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:04,789 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-01-31 16:56:04,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:04,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:04,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:04,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:04,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:06,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:06,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:06,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:06,169 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:06,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:06,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:06,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:56:06,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:06,179 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:56:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:06,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:06,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:09,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:09,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:09,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-01-31 16:56:09,449 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:09,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-31 16:56:09,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-31 16:56:09,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-31 16:56:09,451 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-01-31 16:56:09,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:09,567 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-31 16:56:09,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-31 16:56:09,567 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-01-31 16:56:09,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:09,568 INFO L225 Difference]: With dead ends: 62 [2019-01-31 16:56:09,568 INFO L226 Difference]: Without dead ends: 60 [2019-01-31 16:56:09,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-31 16:56:09,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-31 16:56:09,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-31 16:56:09,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-31 16:56:09,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-31 16:56:09,571 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-01-31 16:56:09,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:09,571 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-31 16:56:09,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-31 16:56:09,571 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-31 16:56:09,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-31 16:56:09,572 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:09,572 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-01-31 16:56:09,572 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:09,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:09,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-01-31 16:56:09,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:09,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:09,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:09,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:09,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:11,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:11,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:11,064 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:11,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:11,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:11,064 INFO 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 16:56:11,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:56:11,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:56:11,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-31 16:56:11,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:11,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:11,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:11,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:14,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:14,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:14,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-01-31 16:56:14,638 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:14,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-31 16:56:14,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-31 16:56:14,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-31 16:56:14,639 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-01-31 16:56:14,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:14,716 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-31 16:56:14,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-31 16:56:14,717 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-01-31 16:56:14,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:14,717 INFO L225 Difference]: With dead ends: 63 [2019-01-31 16:56:14,718 INFO L226 Difference]: Without dead ends: 61 [2019-01-31 16:56:14,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-31 16:56:14,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-31 16:56:14,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-31 16:56:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-31 16:56:14,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-31 16:56:14,721 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-01-31 16:56:14,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:14,722 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-31 16:56:14,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-31 16:56:14,722 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-31 16:56:14,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-31 16:56:14,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:14,722 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-01-31 16:56:14,722 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:14,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:14,723 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-01-31 16:56:14,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:14,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:14,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:14,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:14,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:16,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:16,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:16,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:16,470 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:16,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:16,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:16,470 INFO 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 16:56:16,480 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:56:16,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:56:16,515 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:56:16,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:16,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:16,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:16,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:19,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:19,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:19,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-01-31 16:56:19,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:19,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-31 16:56:19,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-31 16:56:19,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-31 16:56:19,961 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-01-31 16:56:20,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:20,061 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-01-31 16:56:20,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-31 16:56:20,062 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-01-31 16:56:20,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:20,062 INFO L225 Difference]: With dead ends: 64 [2019-01-31 16:56:20,062 INFO L226 Difference]: Without dead ends: 62 [2019-01-31 16:56:20,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-31 16:56:20,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-31 16:56:20,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-31 16:56:20,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-31 16:56:20,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-31 16:56:20,065 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-01-31 16:56:20,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:20,065 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-31 16:56:20,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-31 16:56:20,066 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-31 16:56:20,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-31 16:56:20,066 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:20,066 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-01-31 16:56:20,066 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:20,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:20,066 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-01-31 16:56:20,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:20,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:20,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:20,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:20,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:21,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:21,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:21,694 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:21,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 16:56:21,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:21,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 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 16:56:21,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:21,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:56:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:21,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:21,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:21,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:25,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:25,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:25,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-01-31 16:56:25,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:25,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-31 16:56:25,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-31 16:56:25,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-31 16:56:25,814 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-01-31 16:56:25,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:25,907 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-01-31 16:56:25,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-31 16:56:25,907 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-01-31 16:56:25,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:25,908 INFO L225 Difference]: With dead ends: 65 [2019-01-31 16:56:25,908 INFO L226 Difference]: Without dead ends: 63 [2019-01-31 16:56:25,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-31 16:56:25,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-31 16:56:25,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-31 16:56:25,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-31 16:56:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-01-31 16:56:25,912 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-01-31 16:56:25,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:25,912 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-01-31 16:56:25,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-31 16:56:25,912 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-01-31 16:56:25,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-31 16:56:25,912 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:25,912 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-01-31 16:56:25,912 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:25,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:25,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-01-31 16:56:25,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:25,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:25,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:25,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:25,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:28,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:28,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:28,371 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:28,371 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:28,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:28,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:28,372 INFO 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 16:56:28,380 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:56:28,381 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:56:28,683 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-01-31 16:56:28,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:28,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:28,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:32,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:32,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-01-31 16:56:32,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:32,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-31 16:56:32,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-31 16:56:32,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-31 16:56:32,452 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-01-31 16:56:32,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:32,529 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-31 16:56:32,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-31 16:56:32,529 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-01-31 16:56:32,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:32,530 INFO L225 Difference]: With dead ends: 66 [2019-01-31 16:56:32,530 INFO L226 Difference]: Without dead ends: 64 [2019-01-31 16:56:32,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-31 16:56:32,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-31 16:56:32,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-31 16:56:32,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-31 16:56:32,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-01-31 16:56:32,533 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-01-31 16:56:32,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:32,534 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-01-31 16:56:32,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-31 16:56:32,534 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-01-31 16:56:32,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-31 16:56:32,534 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:32,534 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-01-31 16:56:32,535 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:32,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:32,535 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-01-31 16:56:32,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:32,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:32,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:32,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:32,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:33,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:33,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:33,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:33,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:33,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 16:56:33,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:33,996 INFO 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 16:56:34,004 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:56:34,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:56:34,042 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:56:34,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:34,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:34,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:38,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:38,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-01-31 16:56:38,137 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:38,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-31 16:56:38,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-31 16:56:38,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-31 16:56:38,138 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-01-31 16:56:38,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:38,247 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-01-31 16:56:38,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-31 16:56:38,247 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-01-31 16:56:38,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:38,248 INFO L225 Difference]: With dead ends: 67 [2019-01-31 16:56:38,248 INFO L226 Difference]: Without dead ends: 65 [2019-01-31 16:56:38,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-31 16:56:38,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-31 16:56:38,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-31 16:56:38,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-31 16:56:38,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-01-31 16:56:38,250 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-01-31 16:56:38,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:38,251 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-01-31 16:56:38,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-31 16:56:38,251 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-01-31 16:56:38,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-31 16:56:38,251 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:38,251 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-01-31 16:56:38,251 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:38,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:38,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-01-31 16:56:38,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:38,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:38,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:38,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:38,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:39,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:39,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:39,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:39,816 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:39,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:39,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:39,816 INFO 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 16:56:39,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:39,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:56:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:39,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:39,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:44,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:44,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:44,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-01-31 16:56:44,205 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:44,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-31 16:56:44,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-31 16:56:44,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-31 16:56:44,207 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-01-31 16:56:44,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:44,334 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-01-31 16:56:44,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-31 16:56:44,335 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-01-31 16:56:44,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:44,335 INFO L225 Difference]: With dead ends: 68 [2019-01-31 16:56:44,335 INFO L226 Difference]: Without dead ends: 66 [2019-01-31 16:56:44,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-31 16:56:44,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-31 16:56:44,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-31 16:56:44,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-31 16:56:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-31 16:56:44,338 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-01-31 16:56:44,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:44,339 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-31 16:56:44,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-31 16:56:44,339 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-31 16:56:44,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-31 16:56:44,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:44,340 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-01-31 16:56:44,340 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:44,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:44,340 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-01-31 16:56:44,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:44,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:44,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:44,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:44,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:45,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:45,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:45,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:45,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:45,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:45,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:45,955 INFO 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 16:56:45,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:56:45,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:56:46,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-31 16:56:46,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:46,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:46,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:46,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:50,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:50,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-01-31 16:56:50,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:50,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-31 16:56:50,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-31 16:56:50,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-31 16:56:50,425 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-01-31 16:56:50,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:50,542 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-01-31 16:56:50,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-31 16:56:50,543 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-01-31 16:56:50,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:50,543 INFO L225 Difference]: With dead ends: 69 [2019-01-31 16:56:50,543 INFO L226 Difference]: Without dead ends: 67 [2019-01-31 16:56:50,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-31 16:56:50,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-31 16:56:50,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-31 16:56:50,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-31 16:56:50,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-31 16:56:50,547 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-01-31 16:56:50,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:50,547 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-31 16:56:50,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-31 16:56:50,547 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-31 16:56:50,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-31 16:56:50,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:50,548 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-01-31 16:56:50,548 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:50,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:50,549 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-01-31 16:56:50,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:50,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:50,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:50,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:50,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:52,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:52,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:52,708 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:52,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:52,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:52,709 INFO 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 16:56:52,718 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:56:52,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:56:52,784 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:56:52,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:52,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:52,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:52,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:57,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:57,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-01-31 16:56:57,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:57,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-31 16:56:57,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-31 16:56:57,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-31 16:56:57,284 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-01-31 16:56:57,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:57,399 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-31 16:56:57,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-31 16:56:57,401 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-01-31 16:56:57,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:57,402 INFO L225 Difference]: With dead ends: 70 [2019-01-31 16:56:57,402 INFO L226 Difference]: Without dead ends: 68 [2019-01-31 16:56:57,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-31 16:56:57,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-31 16:56:57,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-31 16:56:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-31 16:56:57,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-01-31 16:56:57,406 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-01-31 16:56:57,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:57,406 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-01-31 16:56:57,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-31 16:56:57,406 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-01-31 16:56:57,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-31 16:56:57,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:57,407 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-01-31 16:56:57,407 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:57,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:57,408 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-01-31 16:56:57,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:57,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:57,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:57,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:57,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:59,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:59,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:59,054 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:59,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:59,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:59,054 INFO 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 16:56:59,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:59,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:56:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:59,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:59,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:59,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:03,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:03,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:03,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-01-31 16:57:03,846 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:03,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-31 16:57:03,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-31 16:57:03,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-31 16:57:03,847 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-01-31 16:57:03,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:03,954 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-01-31 16:57:03,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-31 16:57:03,954 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-01-31 16:57:03,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:03,955 INFO L225 Difference]: With dead ends: 71 [2019-01-31 16:57:03,955 INFO L226 Difference]: Without dead ends: 69 [2019-01-31 16:57:03,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-31 16:57:03,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-31 16:57:03,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-31 16:57:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-31 16:57:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-01-31 16:57:03,959 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-01-31 16:57:03,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:03,959 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-01-31 16:57:03,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-31 16:57:03,959 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-01-31 16:57:03,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-31 16:57:03,959 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:03,960 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-01-31 16:57:03,960 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:57:03,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:03,960 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-01-31 16:57:03,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:03,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:03,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:57:03,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:03,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:06,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:06,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:06,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:06,122 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:06,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:06,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:06,122 INFO 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 16:57:06,130 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:57:06,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:57:06,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-31 16:57:06,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:57:06,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:06,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:06,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:12,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:12,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:12,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-01-31 16:57:12,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:12,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-31 16:57:12,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-31 16:57:12,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-31 16:57:12,326 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-01-31 16:57:12,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:12,427 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-01-31 16:57:12,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-31 16:57:12,428 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-01-31 16:57:12,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:12,429 INFO L225 Difference]: With dead ends: 72 [2019-01-31 16:57:12,429 INFO L226 Difference]: Without dead ends: 70 [2019-01-31 16:57:12,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-31 16:57:12,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-31 16:57:12,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-31 16:57:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-31 16:57:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-01-31 16:57:12,431 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-01-31 16:57:12,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:12,432 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-01-31 16:57:12,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-31 16:57:12,432 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-01-31 16:57:12,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-31 16:57:12,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:12,433 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-01-31 16:57:12,433 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:57:12,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:12,433 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-01-31 16:57:12,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:12,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:12,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:57:12,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:12,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:14,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:14,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:14,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:14,016 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:14,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:14,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:14,016 INFO 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 16:57:14,029 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:57:14,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:57:14,072 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:57:14,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:57:14,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:14,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:19,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:19,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-01-31 16:57:19,039 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:19,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-31 16:57:19,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-31 16:57:19,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-31 16:57:19,041 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-01-31 16:57:19,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:19,330 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-01-31 16:57:19,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-31 16:57:19,330 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-01-31 16:57:19,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:19,331 INFO L225 Difference]: With dead ends: 73 [2019-01-31 16:57:19,331 INFO L226 Difference]: Without dead ends: 71 [2019-01-31 16:57:19,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 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 16:57:19,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-31 16:57:19,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-31 16:57:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-31 16:57:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-31 16:57:19,334 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-01-31 16:57:19,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:19,334 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-31 16:57:19,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-31 16:57:19,334 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-31 16:57:19,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-31 16:57:19,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:19,334 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-01-31 16:57:19,335 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:57:19,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:19,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-01-31 16:57:19,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:19,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:19,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:57:19,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:19,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:21,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:21,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:21,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:21,053 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:21,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:21,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:21,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:57:21,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:57:21,068 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:57:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:21,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:21,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:21,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:26,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:26,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-01-31 16:57:26,214 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:26,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-31 16:57:26,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-31 16:57:26,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-31 16:57:26,215 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-01-31 16:57:26,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:26,306 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-01-31 16:57:26,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-31 16:57:26,306 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-01-31 16:57:26,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:26,307 INFO L225 Difference]: With dead ends: 74 [2019-01-31 16:57:26,307 INFO L226 Difference]: Without dead ends: 72 [2019-01-31 16:57:26,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-31 16:57:26,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-31 16:57:26,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-31 16:57:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-31 16:57:26,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-31 16:57:26,312 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-01-31 16:57:26,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:26,312 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-31 16:57:26,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-31 16:57:26,312 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-31 16:57:26,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-31 16:57:26,312 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:26,313 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-01-31 16:57:26,313 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:57:26,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:26,313 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-01-31 16:57:26,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:26,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:26,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:57:26,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:26,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:28,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:28,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:28,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:28,293 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:28,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:28,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:28,294 INFO 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 16:57:28,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:57:28,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:57:28,753 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-31 16:57:28,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:57:28,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:28,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:28,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:33,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:33,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:33,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-01-31 16:57:33,888 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:33,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-31 16:57:33,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-31 16:57:33,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-31 16:57:33,889 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-01-31 16:57:34,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:34,085 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-31 16:57:34,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-31 16:57:34,085 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-01-31 16:57:34,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:34,085 INFO L225 Difference]: With dead ends: 75 [2019-01-31 16:57:34,085 INFO L226 Difference]: Without dead ends: 73 [2019-01-31 16:57:34,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-31 16:57:34,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-31 16:57:34,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-31 16:57:34,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-31 16:57:34,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-01-31 16:57:34,088 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-01-31 16:57:34,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:34,089 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-01-31 16:57:34,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-31 16:57:34,089 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-01-31 16:57:34,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-31 16:57:34,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:34,090 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-01-31 16:57:34,090 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:57:34,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:34,090 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-01-31 16:57:34,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:34,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:34,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:57:34,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:34,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:35,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:35,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:35,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:35,918 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:35,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 16:57:35,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:35,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 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 16:57:35,926 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:57:35,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:57:35,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:57:35,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:57:35,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:36,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:41,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:41,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:41,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-01-31 16:57:41,401 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:41,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-31 16:57:41,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-31 16:57:41,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-31 16:57:41,403 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-01-31 16:57:41,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:41,590 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-31 16:57:41,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-31 16:57:41,590 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-01-31 16:57:41,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:41,591 INFO L225 Difference]: With dead ends: 76 [2019-01-31 16:57:41,591 INFO L226 Difference]: Without dead ends: 74 [2019-01-31 16:57:41,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-31 16:57:41,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-31 16:57:41,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-31 16:57:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-31 16:57:41,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-01-31 16:57:41,594 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-01-31 16:57:41,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:41,595 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-01-31 16:57:41,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-31 16:57:41,595 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-01-31 16:57:41,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-31 16:57:41,595 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:41,596 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-01-31 16:57:41,596 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:57:41,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:41,596 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-01-31 16:57:41,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:41,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:41,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:57:41,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:41,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:44,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:44,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:44,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:44,102 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:44,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:44,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:44,103 INFO 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 16:57:44,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:57:44,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:57:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:44,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:44,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:44,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:49,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:49,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-01-31 16:57:49,701 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:49,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-31 16:57:49,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-31 16:57:49,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-31 16:57:49,703 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-01-31 16:57:49,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:49,910 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-01-31 16:57:49,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-31 16:57:49,910 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-01-31 16:57:49,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:49,911 INFO L225 Difference]: With dead ends: 77 [2019-01-31 16:57:49,911 INFO L226 Difference]: Without dead ends: 75 [2019-01-31 16:57:49,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-31 16:57:49,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-31 16:57:49,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-31 16:57:49,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-31 16:57:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-01-31 16:57:49,916 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-01-31 16:57:49,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:49,916 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-01-31 16:57:49,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-31 16:57:49,916 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-01-31 16:57:49,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-31 16:57:49,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:49,917 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-01-31 16:57:49,917 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:57:49,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:49,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-01-31 16:57:49,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:49,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:49,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:57:49,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:49,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:52,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:52,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:52,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:52,012 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:52,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:52,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:52,012 INFO 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 16:57:52,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:57:52,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:57:52,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-01-31 16:57:52,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:57:52,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:52,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:58,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:58,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-01-31 16:57:58,159 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:58,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-31 16:57:58,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-31 16:57:58,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-31 16:57:58,161 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-01-31 16:57:58,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:58,296 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-01-31 16:57:58,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-31 16:57:58,297 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-01-31 16:57:58,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:58,297 INFO L225 Difference]: With dead ends: 78 [2019-01-31 16:57:58,297 INFO L226 Difference]: Without dead ends: 76 [2019-01-31 16:57:58,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-31 16:57:58,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-31 16:57:58,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-31 16:57:58,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-31 16:57:58,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-31 16:57:58,301 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-01-31 16:57:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:58,301 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-31 16:57:58,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-31 16:57:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-31 16:57:58,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-31 16:57:58,302 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:58,302 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-01-31 16:57:58,302 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:57:58,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:58,303 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-01-31 16:57:58,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:58,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:58,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:57:58,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:58,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:00,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:00,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:00,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:00,293 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:00,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:00,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:00,293 INFO 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 16:58:00,302 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:58:00,302 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:58:00,347 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:58:00,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:58:00,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:00,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:00,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:06,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:06,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-01-31 16:58:06,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:06,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-31 16:58:06,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-31 16:58:06,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-31 16:58:06,250 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-01-31 16:58:06,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:06,393 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-01-31 16:58:06,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-31 16:58:06,393 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-01-31 16:58:06,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:06,394 INFO L225 Difference]: With dead ends: 79 [2019-01-31 16:58:06,394 INFO L226 Difference]: Without dead ends: 77 [2019-01-31 16:58:06,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-31 16:58:06,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-31 16:58:06,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-31 16:58:06,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-31 16:58:06,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-01-31 16:58:06,397 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-01-31 16:58:06,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:06,397 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-01-31 16:58:06,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-31 16:58:06,397 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-01-31 16:58:06,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-31 16:58:06,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:06,397 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-01-31 16:58:06,398 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:58:06,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:06,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-01-31 16:58:06,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:06,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:06,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:58:06,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:06,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:08,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:08,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:08,605 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:08,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:08,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:08,605 INFO 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 16:58:08,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:58:08,613 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:58:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:08,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:08,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:08,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:14,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:14,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:14,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-01-31 16:58:14,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:14,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-31 16:58:14,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-31 16:58:14,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-31 16:58:14,619 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-01-31 16:58:14,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:14,769 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-31 16:58:14,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-31 16:58:14,769 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-01-31 16:58:14,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:14,770 INFO L225 Difference]: With dead ends: 80 [2019-01-31 16:58:14,770 INFO L226 Difference]: Without dead ends: 78 [2019-01-31 16:58:14,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-31 16:58:14,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-31 16:58:14,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-31 16:58:14,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-31 16:58:14,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-01-31 16:58:14,772 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-01-31 16:58:14,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:14,773 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-01-31 16:58:14,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-31 16:58:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-01-31 16:58:14,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-31 16:58:14,774 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:14,774 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-01-31 16:58:14,774 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:58:14,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:14,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-01-31 16:58:14,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:14,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:14,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:58:14,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:14,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:16,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:16,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:16,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:16,841 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:16,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:16,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:16,841 INFO 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 16:58:16,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:58:16,850 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:58:17,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-31 16:58:17,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:58:17,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:17,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:23,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:23,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:23,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-01-31 16:58:23,812 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:23,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-31 16:58:23,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-31 16:58:23,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-31 16:58:23,814 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-01-31 16:58:23,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:23,932 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-01-31 16:58:23,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-31 16:58:23,932 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-01-31 16:58:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:23,933 INFO L225 Difference]: With dead ends: 81 [2019-01-31 16:58:23,933 INFO L226 Difference]: Without dead ends: 79 [2019-01-31 16:58:23,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-31 16:58:23,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-31 16:58:23,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-31 16:58:23,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-31 16:58:23,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-01-31 16:58:23,936 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-01-31 16:58:23,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:23,936 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-01-31 16:58:23,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-31 16:58:23,937 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-01-31 16:58:23,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-31 16:58:23,937 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:23,938 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-01-31 16:58:23,938 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:58:23,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:23,939 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-01-31 16:58:23,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:23,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:23,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:58:23,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:23,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:26,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:26,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:26,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:26,036 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:26,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:26,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:26,036 INFO 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 16:58:26,043 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:58:26,044 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:58:26,092 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:58:26,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:58:26,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:26,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:26,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:32,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:32,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-01-31 16:58:32,436 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:32,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-31 16:58:32,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-31 16:58:32,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-31 16:58:32,437 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-01-31 16:58:32,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:32,552 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-01-31 16:58:32,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-31 16:58:32,553 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-01-31 16:58:32,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:32,554 INFO L225 Difference]: With dead ends: 82 [2019-01-31 16:58:32,554 INFO L226 Difference]: Without dead ends: 80 [2019-01-31 16:58:32,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-31 16:58:32,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-31 16:58:32,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-31 16:58:32,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-31 16:58:32,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-01-31 16:58:32,558 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-01-31 16:58:32,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:32,559 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-01-31 16:58:32,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-31 16:58:32,559 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-01-31 16:58:32,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-31 16:58:32,559 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:32,559 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-01-31 16:58:32,560 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:58:32,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:32,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-01-31 16:58:32,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:32,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:32,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:58:32,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:32,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:34,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:34,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:34,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:34,926 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:34,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:34,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:34,926 INFO 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 16:58:34,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:58:34,935 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:58:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:34,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:34,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:41,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:41,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:41,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-01-31 16:58:41,483 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:41,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-31 16:58:41,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-31 16:58:41,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-31 16:58:41,485 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-01-31 16:58:42,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:42,270 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-01-31 16:58:42,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-31 16:58:42,270 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-01-31 16:58:42,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:42,271 INFO L225 Difference]: With dead ends: 83 [2019-01-31 16:58:42,271 INFO L226 Difference]: Without dead ends: 81 [2019-01-31 16:58:42,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-31 16:58:42,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-31 16:58:42,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-31 16:58:42,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-31 16:58:42,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-31 16:58:42,274 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-01-31 16:58:42,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:42,274 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-31 16:58:42,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-31 16:58:42,274 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-31 16:58:42,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-31 16:58:42,274 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:42,275 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-01-31 16:58:42,275 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:58:42,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:42,275 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-01-31 16:58:42,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:42,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:42,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:58:42,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:42,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:44,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:44,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:44,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:44,517 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:44,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:44,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:44,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:58:44,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:58:44,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:58:45,239 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-31 16:58:45,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:58:45,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:45,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:52,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:52,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:52,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-01-31 16:58:52,146 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:52,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-31 16:58:52,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-31 16:58:52,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-31 16:58:52,148 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-01-31 16:58:52,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:52,765 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-01-31 16:58:52,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-31 16:58:52,765 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-01-31 16:58:52,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:52,766 INFO L225 Difference]: With dead ends: 84 [2019-01-31 16:58:52,766 INFO L226 Difference]: Without dead ends: 82 [2019-01-31 16:58:52,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-31 16:58:52,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-31 16:58:52,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-01-31 16:58:52,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-31 16:58:52,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-31 16:58:52,769 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-01-31 16:58:52,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:52,770 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-31 16:58:52,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-31 16:58:52,770 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-31 16:58:52,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-31 16:58:52,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:52,770 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-01-31 16:58:52,771 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:58:52,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:52,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-01-31 16:58:52,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:52,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:52,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:58:52,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:52,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:55,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:55,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:55,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:55,345 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:55,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:55,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:55,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:58:55,353 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:58:55,353 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:58:55,411 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:58:55,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:58:55,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:55,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:55,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:02,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:02,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:02,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-01-31 16:59:02,419 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:02,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-31 16:59:02,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-31 16:59:02,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-31 16:59:02,421 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-01-31 16:59:02,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:02,572 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-01-31 16:59:02,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-31 16:59:02,572 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-01-31 16:59:02,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:02,573 INFO L225 Difference]: With dead ends: 85 [2019-01-31 16:59:02,573 INFO L226 Difference]: Without dead ends: 83 [2019-01-31 16:59:02,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-31 16:59:02,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-31 16:59:02,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-31 16:59:02,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-31 16:59:02,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-01-31 16:59:02,577 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-01-31 16:59:02,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:02,577 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-01-31 16:59:02,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-31 16:59:02,577 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-01-31 16:59:02,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-31 16:59:02,578 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:02,578 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-01-31 16:59:02,578 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:59:02,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:02,579 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-01-31 16:59:02,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:02,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:02,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:59:02,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:02,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:05,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:05,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:05,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:05,432 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:05,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:05,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:05,432 INFO 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 16:59:05,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:59:05,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:59:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:05,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:05,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:12,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:12,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-01-31 16:59:12,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:12,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-31 16:59:12,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-31 16:59:12,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-31 16:59:12,436 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-01-31 16:59:12,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:12,558 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-01-31 16:59:12,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-31 16:59:12,558 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-01-31 16:59:12,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:12,559 INFO L225 Difference]: With dead ends: 86 [2019-01-31 16:59:12,559 INFO L226 Difference]: Without dead ends: 84 [2019-01-31 16:59:12,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-31 16:59:12,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-31 16:59:12,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-01-31 16:59:12,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-31 16:59:12,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-01-31 16:59:12,563 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-01-31 16:59:12,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:12,564 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-01-31 16:59:12,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-31 16:59:12,564 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-01-31 16:59:12,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-31 16:59:12,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:12,564 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-01-31 16:59:12,564 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:59:12,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:12,565 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-01-31 16:59:12,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:12,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:12,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:59:12,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:12,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:15,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:15,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:15,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:15,411 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:15,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 16:59:15,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:15,412 INFO 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 16:59:15,419 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:59:15,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:59:16,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-31 16:59:16,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:59:16,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:16,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:23,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:23,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:23,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-01-31 16:59:23,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:23,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-31 16:59:23,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-31 16:59:23,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-31 16:59:23,268 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-01-31 16:59:23,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:23,458 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-01-31 16:59:23,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-31 16:59:23,458 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-01-31 16:59:23,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:23,458 INFO L225 Difference]: With dead ends: 87 [2019-01-31 16:59:23,459 INFO L226 Difference]: Without dead ends: 85 [2019-01-31 16:59:23,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-31 16:59:23,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-31 16:59:23,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-31 16:59:23,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-31 16:59:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-01-31 16:59:23,461 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-01-31 16:59:23,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:23,461 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-01-31 16:59:23,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-31 16:59:23,461 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-01-31 16:59:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-31 16:59:23,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:23,462 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-01-31 16:59:23,462 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:59:23,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:23,462 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-01-31 16:59:23,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:23,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:23,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:59:23,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:23,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:26,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:26,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:26,095 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:26,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:26,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:26,095 INFO 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 16:59:26,105 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:59:26,105 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:59:26,155 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:59:26,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:59:26,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:26,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:26,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:33,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:33,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:33,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-01-31 16:59:33,258 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:33,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-31 16:59:33,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-31 16:59:33,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-31 16:59:33,260 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-01-31 16:59:33,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:33,442 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-01-31 16:59:33,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-31 16:59:33,443 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-01-31 16:59:33,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:33,443 INFO L225 Difference]: With dead ends: 88 [2019-01-31 16:59:33,443 INFO L226 Difference]: Without dead ends: 86 [2019-01-31 16:59:33,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-31 16:59:33,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-31 16:59:33,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-31 16:59:33,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-31 16:59:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-31 16:59:33,446 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-01-31 16:59:33,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:33,446 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-31 16:59:33,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-31 16:59:33,446 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-31 16:59:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-31 16:59:33,447 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:33,447 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-01-31 16:59:33,447 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:59:33,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:33,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-01-31 16:59:33,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:33,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:33,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:59:33,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:33,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:36,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:36,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:36,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:36,286 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:36,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:36,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:36,286 INFO 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 16:59:36,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:59:36,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:59:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:36,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:36,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:43,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:43,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:43,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-01-31 16:59:43,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:43,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-31 16:59:43,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-31 16:59:43,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-31 16:59:43,698 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-01-31 16:59:43,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:43,845 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-01-31 16:59:43,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-31 16:59:43,846 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-01-31 16:59:43,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:43,846 INFO L225 Difference]: With dead ends: 89 [2019-01-31 16:59:43,846 INFO L226 Difference]: Without dead ends: 87 [2019-01-31 16:59:43,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-31 16:59:43,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-31 16:59:43,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-31 16:59:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-31 16:59:43,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-01-31 16:59:43,850 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-01-31 16:59:43,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:43,850 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-01-31 16:59:43,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-31 16:59:43,850 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-01-31 16:59:43,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-31 16:59:43,851 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:43,851 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-01-31 16:59:43,851 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:59:43,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:43,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-01-31 16:59:43,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:43,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:43,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:59:43,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:43,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:46,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:46,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:46,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:46,720 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:46,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:46,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:46,721 INFO 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 16:59:46,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:59:46,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:59:47,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-31 16:59:47,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:59:47,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:47,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:55,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:55,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:55,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-01-31 16:59:55,135 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:55,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-31 16:59:55,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-31 16:59:55,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-31 16:59:55,137 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-01-31 16:59:55,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:55,337 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-31 16:59:55,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-31 16:59:55,337 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-01-31 16:59:55,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:55,338 INFO L225 Difference]: With dead ends: 90 [2019-01-31 16:59:55,338 INFO L226 Difference]: Without dead ends: 88 [2019-01-31 16:59:55,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-31 16:59:55,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-31 16:59:55,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-01-31 16:59:55,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-31 16:59:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-01-31 16:59:55,341 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-01-31 16:59:55,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:55,341 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-01-31 16:59:55,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-31 16:59:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-01-31 16:59:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-31 16:59:55,342 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:55,342 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-01-31 16:59:55,342 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:59:55,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:55,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-01-31 16:59:55,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:55,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:55,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:59:55,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:55,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:57,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:57,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:57,997 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:57,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 16:59:57,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:57,998 INFO 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 16:59:58,006 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:59:58,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:59:58,056 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:59:58,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:59:58,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:58,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:58,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:06,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:00:06,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-01-31 17:00:06,072 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:00:06,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-31 17:00:06,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-31 17:00:06,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-31 17:00:06,074 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-01-31 17:00:06,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:00:06,228 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-01-31 17:00:06,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-31 17:00:06,228 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-01-31 17:00:06,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:00:06,229 INFO L225 Difference]: With dead ends: 91 [2019-01-31 17:00:06,229 INFO L226 Difference]: Without dead ends: 89 [2019-01-31 17:00:06,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-31 17:00:06,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-31 17:00:06,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-31 17:00:06,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-31 17:00:06,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-01-31 17:00:06,232 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-01-31 17:00:06,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:00:06,233 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-01-31 17:00:06,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-31 17:00:06,233 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-01-31 17:00:06,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-31 17:00:06,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:00:06,233 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-01-31 17:00:06,234 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:00:06,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:00:06,234 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-01-31 17:00:06,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:00:06,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:06,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:00:06,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:06,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:00:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:08,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:08,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:08,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:00:08,801 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:00:08,801 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:00:08,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:08,801 INFO 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:00:08,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:00:08,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:00:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:08,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:00:08,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:08,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:16,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:16,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:00:16,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-01-31 17:00:16,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:00:16,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-31 17:00:16,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-31 17:00:16,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-31 17:00:16,985 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-01-31 17:00:17,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:00:17,328 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-01-31 17:00:17,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-31 17:00:17,329 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-01-31 17:00:17,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:00:17,329 INFO L225 Difference]: With dead ends: 92 [2019-01-31 17:00:17,329 INFO L226 Difference]: Without dead ends: 90 [2019-01-31 17:00:17,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 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:00:17,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-31 17:00:17,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-01-31 17:00:17,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-31 17:00:17,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-01-31 17:00:17,333 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-01-31 17:00:17,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:00:17,334 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-01-31 17:00:17,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-31 17:00:17,334 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-01-31 17:00:17,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-31 17:00:17,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:00:17,335 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-01-31 17:00:17,335 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:00:17,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:00:17,335 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-01-31 17:00:17,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:00:17,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:17,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:00:17,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:17,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:00:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:20,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:20,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:00:20,016 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:00:20,017 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:00:20,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:20,017 INFO 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:00:20,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:00:20,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:00:21,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-31 17:00:21,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:00:21,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:00:21,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:21,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:29,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:29,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:00:29,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-01-31 17:00:29,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:00:29,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-31 17:00:29,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-31 17:00:29,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-31 17:00:29,326 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-01-31 17:00:29,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:00:29,545 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-01-31 17:00:29,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-31 17:00:29,545 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-01-31 17:00:29,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:00:29,545 INFO L225 Difference]: With dead ends: 93 [2019-01-31 17:00:29,546 INFO L226 Difference]: Without dead ends: 91 [2019-01-31 17:00:29,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-31 17:00:29,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-31 17:00:29,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-31 17:00:29,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-31 17:00:29,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-31 17:00:29,549 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-01-31 17:00:29,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:00:29,549 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-31 17:00:29,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-31 17:00:29,549 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-31 17:00:29,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-31 17:00:29,549 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:00:29,549 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-01-31 17:00:29,549 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:00:29,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:00:29,550 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-01-31 17:00:29,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:00:29,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:29,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:00:29,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:29,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:00:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:32,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:32,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:32,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:00:32,596 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:00:32,597 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:00:32,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:32,597 INFO 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:00:32,605 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:00:32,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:00:32,659 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:00:32,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:00:32,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:00:32,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:32,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:40,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:40,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:00:40,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-01-31 17:00:40,921 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:00:40,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-31 17:00:40,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-31 17:00:40,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-31 17:00:40,923 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-01-31 17:00:41,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:00:41,059 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-01-31 17:00:41,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-31 17:00:41,060 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-01-31 17:00:41,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:00:41,061 INFO L225 Difference]: With dead ends: 94 [2019-01-31 17:00:41,061 INFO L226 Difference]: Without dead ends: 92 [2019-01-31 17:00:41,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 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:00:41,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-31 17:00:41,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-31 17:00:41,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-31 17:00:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-31 17:00:41,065 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-01-31 17:00:41,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:00:41,065 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-31 17:00:41,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-31 17:00:41,066 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-31 17:00:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-31 17:00:41,066 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:00:41,066 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-01-31 17:00:41,066 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:00:41,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:00:41,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-01-31 17:00:41,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:00:41,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:41,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:00:41,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:41,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:00:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:44,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:44,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:00:44,177 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:00:44,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:00:44,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:44,177 INFO 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:00:44,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:00:44,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:00:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:44,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:00:44,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:44,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:52,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:00:52,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-01-31 17:00:52,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:00:52,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-31 17:00:52,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-31 17:00:52,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-31 17:00:52,873 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-01-31 17:00:53,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:00:53,084 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-31 17:00:53,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-31 17:00:53,084 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-01-31 17:00:53,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:00:53,085 INFO L225 Difference]: With dead ends: 95 [2019-01-31 17:00:53,085 INFO L226 Difference]: Without dead ends: 93 [2019-01-31 17:00:53,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-31 17:00:53,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-31 17:00:53,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-31 17:00:53,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-31 17:00:53,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-01-31 17:00:53,088 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-01-31 17:00:53,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:00:53,088 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-01-31 17:00:53,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-31 17:00:53,088 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-01-31 17:00:53,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-31 17:00:53,088 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:00:53,089 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-01-31 17:00:53,089 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:00:53,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:00:53,089 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-01-31 17:00:53,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:00:53,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:53,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:00:53,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:53,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:00:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:55,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:55,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:00:55,899 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:00:55,899 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:00:55,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:55,899 INFO 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:00:55,907 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:00:55,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:00:57,123 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-31 17:00:57,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:00:57,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:00:57,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:57,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:01:05,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:05,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:01:05,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-01-31 17:01:05,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:01:05,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-31 17:01:05,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-31 17:01:05,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-31 17:01:05,672 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-01-31 17:01:05,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:01:05,809 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-31 17:01:05,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-31 17:01:05,809 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-01-31 17:01:05,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:01:05,810 INFO L225 Difference]: With dead ends: 96 [2019-01-31 17:01:05,810 INFO L226 Difference]: Without dead ends: 94 [2019-01-31 17:01:05,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-31 17:01:05,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-31 17:01:05,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-01-31 17:01:05,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-31 17:01:05,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-01-31 17:01:05,814 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-01-31 17:01:05,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:01:05,814 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-01-31 17:01:05,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-31 17:01:05,815 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-01-31 17:01:05,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-31 17:01:05,815 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:01:05,815 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-01-31 17:01:05,815 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:01:05,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:01:05,816 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-01-31 17:01:05,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:01:05,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:05,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:01:05,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:05,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:01:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:08,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:08,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:08,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:01:08,924 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:01:08,924 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:01:08,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:08,925 INFO 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:01:08,933 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:01:08,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:01:08,991 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:01:08,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:01:08,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:01:09,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:09,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:01:18,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:18,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:01:18,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-01-31 17:01:18,245 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:01:18,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-31 17:01:18,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-31 17:01:18,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-31 17:01:18,247 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-01-31 17:01:18,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:01:18,475 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-01-31 17:01:18,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-31 17:01:18,476 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-01-31 17:01:18,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:01:18,476 INFO L225 Difference]: With dead ends: 97 [2019-01-31 17:01:18,477 INFO L226 Difference]: Without dead ends: 95 [2019-01-31 17:01:18,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-31 17:01:18,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-31 17:01:18,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-31 17:01:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-31 17:01:18,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-01-31 17:01:18,480 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-01-31 17:01:18,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:01:18,481 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-01-31 17:01:18,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-31 17:01:18,481 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-01-31 17:01:18,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-31 17:01:18,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:01:18,482 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-01-31 17:01:18,482 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:01:18,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:01:18,482 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-01-31 17:01:18,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:01:18,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:18,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:01:18,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:18,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:01:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:21,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:21,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:01:21,466 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:01:21,466 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:01:21,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:21,466 INFO 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:01:21,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:01:21,475 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:01:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:21,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:01:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:21,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:01:30,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:30,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:01:30,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-01-31 17:01:30,778 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:01:30,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-31 17:01:30,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-31 17:01:30,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-31 17:01:30,779 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-01-31 17:01:30,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:01:30,964 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-01-31 17:01:30,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-31 17:01:30,964 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-01-31 17:01:30,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:01:30,965 INFO L225 Difference]: With dead ends: 98 [2019-01-31 17:01:30,965 INFO L226 Difference]: Without dead ends: 96 [2019-01-31 17:01:30,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-31 17:01:30,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-31 17:01:30,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-31 17:01:30,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-31 17:01:30,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-31 17:01:30,968 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-01-31 17:01:30,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:01:30,968 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-31 17:01:30,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-31 17:01:30,968 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-31 17:01:30,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-31 17:01:30,969 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:01:30,969 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-01-31 17:01:30,969 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:01:30,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:01:30,970 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-01-31 17:01:30,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:01:30,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:30,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:01:30,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:30,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:01:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:34,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:34,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:01:34,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:01:34,378 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:01:34,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:34,378 INFO 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:01:34,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:01:34,387 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:01:35,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-01-31 17:01:35,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:01:35,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:01:35,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:35,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:01:45,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:45,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:01:45,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-01-31 17:01:45,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:01:45,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-31 17:01:45,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-31 17:01:45,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-31 17:01:45,180 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-01-31 17:01:45,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:01:45,325 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-01-31 17:01:45,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-31 17:01:45,325 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-01-31 17:01:45,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:01:45,326 INFO L225 Difference]: With dead ends: 99 [2019-01-31 17:01:45,326 INFO L226 Difference]: Without dead ends: 97 [2019-01-31 17:01:45,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-31 17:01:45,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-31 17:01:45,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-31 17:01:45,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-31 17:01:45,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-31 17:01:45,329 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-01-31 17:01:45,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:01:45,329 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-31 17:01:45,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-31 17:01:45,329 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-31 17:01:45,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-31 17:01:45,330 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:01:45,330 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-01-31 17:01:45,330 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:01:45,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:01:45,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-01-31 17:01:45,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:01:45,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:45,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:01:45,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:45,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:01:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:48,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:48,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:01:48,710 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:01:48,711 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:01:48,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:48,711 INFO 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:01:48,718 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:01:48,718 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:01:48,773 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:01:48,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:01:48,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:01:48,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:48,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:01:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:58,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:01:58,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-01-31 17:01:58,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:01:58,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-31 17:01:58,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-31 17:01:58,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-31 17:01:58,165 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-01-31 17:01:58,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:01:58,345 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-31 17:01:58,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-31 17:01:58,345 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-01-31 17:01:58,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:01:58,346 INFO L225 Difference]: With dead ends: 100 [2019-01-31 17:01:58,346 INFO L226 Difference]: Without dead ends: 98 [2019-01-31 17:01:58,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-31 17:01:58,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-31 17:01:58,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-31 17:01:58,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-31 17:01:58,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-01-31 17:01:58,350 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-01-31 17:01:58,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:01:58,350 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-01-31 17:01:58,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-31 17:01:58,350 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-01-31 17:01:58,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-31 17:01:58,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:01:58,351 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-01-31 17:01:58,351 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:01:58,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:01:58,351 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-01-31 17:01:58,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:01:58,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:58,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:01:58,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:58,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:01:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:01,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:01,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:01,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:02:01,480 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:02:01,480 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:02:01,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:01,480 INFO 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:02:01,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:02:01,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:02:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:01,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:02:01,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:01,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:02:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:11,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:02:11,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-01-31 17:02:11,348 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:02:11,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-31 17:02:11,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-31 17:02:11,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-31 17:02:11,350 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-01-31 17:02:11,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:02:11,500 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-01-31 17:02:11,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-31 17:02:11,500 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-01-31 17:02:11,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:02:11,501 INFO L225 Difference]: With dead ends: 101 [2019-01-31 17:02:11,501 INFO L226 Difference]: Without dead ends: 99 [2019-01-31 17:02:11,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 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:02:11,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-31 17:02:11,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-31 17:02:11,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-31 17:02:11,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-01-31 17:02:11,505 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-01-31 17:02:11,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:02:11,506 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-01-31 17:02:11,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-31 17:02:11,506 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-01-31 17:02:11,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-31 17:02:11,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:02:11,506 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-01-31 17:02:11,507 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:02:11,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:02:11,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-01-31 17:02:11,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:02:11,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:11,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:02:11,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:11,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:02:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:14,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:14,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:14,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:02:14,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:02:14,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:02:14,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:14,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 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:02:14,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:02:14,879 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:02:16,381 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-01-31 17:02:16,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:02:16,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:02:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:16,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:02:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:26,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:02:26,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-01-31 17:02:26,417 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:02:26,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-31 17:02:26,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-31 17:02:26,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-31 17:02:26,419 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-01-31 17:02:26,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:02:26,580 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-01-31 17:02:26,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-31 17:02:26,581 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-01-31 17:02:26,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:02:26,581 INFO L225 Difference]: With dead ends: 102 [2019-01-31 17:02:26,581 INFO L226 Difference]: Without dead ends: 100 [2019-01-31 17:02:26,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-31 17:02:26,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-31 17:02:26,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-31 17:02:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-31 17:02:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-31 17:02:26,585 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-01-31 17:02:26,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:02:26,585 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-31 17:02:26,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-31 17:02:26,585 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-31 17:02:26,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-31 17:02:26,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:02:26,586 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-01-31 17:02:26,586 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:02:26,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:02:26,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-01-31 17:02:26,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:02:26,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:26,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:02:26,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:26,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:02:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:30,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:30,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:30,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:02:30,092 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:02:30,092 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:02:30,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:30,093 INFO 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:02:30,100 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:02:30,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:02:30,158 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:02:30,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:02:30,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:02:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:30,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:02:40,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:40,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:02:40,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-01-31 17:02:40,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:02:40,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-31 17:02:40,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-31 17:02:40,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-31 17:02:40,432 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-01-31 17:02:40,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:02:40,655 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-31 17:02:40,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-31 17:02:40,655 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-01-31 17:02:40,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:02:40,656 INFO L225 Difference]: With dead ends: 103 [2019-01-31 17:02:40,656 INFO L226 Difference]: Without dead ends: 101 [2019-01-31 17:02:40,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-31 17:02:40,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-31 17:02:40,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-31 17:02:40,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-31 17:02:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-31 17:02:40,659 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-01-31 17:02:40,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:02:40,660 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-31 17:02:40,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-31 17:02:40,660 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-31 17:02:40,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-31 17:02:40,660 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:02:40,660 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-01-31 17:02:40,661 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:02:40,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:02:40,661 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-01-31 17:02:40,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:02:40,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:40,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:02:40,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:40,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:02:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:44,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:44,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:44,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:02:44,114 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:02:44,114 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:02:44,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:44,114 INFO 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:02:44,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:02:44,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:02:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:44,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:02:44,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:44,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:02:54,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:54,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:02:54,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-01-31 17:02:54,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:02:54,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-31 17:02:54,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-31 17:02:54,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-31 17:02:54,297 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-01-31 17:02:54,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:02:54,611 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-01-31 17:02:54,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-31 17:02:54,612 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-01-31 17:02:54,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:02:54,612 INFO L225 Difference]: With dead ends: 104 [2019-01-31 17:02:54,613 INFO L226 Difference]: Without dead ends: 102 [2019-01-31 17:02:54,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-31 17:02:54,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-31 17:02:54,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-31 17:02:54,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-31 17:02:54,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-31 17:02:54,617 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-01-31 17:02:54,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:02:54,617 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-31 17:02:54,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-31 17:02:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-31 17:02:54,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-31 17:02:54,618 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:02:54,618 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-01-31 17:02:54,618 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:02:54,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:02:54,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-01-31 17:02:54,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:02:54,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:54,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:02:54,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:54,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:02:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:58,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:58,189 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:02:58,189 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:02:58,189 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:02:58,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:58,189 INFO 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:02:58,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:02:58,197 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:02:59,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-01-31 17:02:59,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:02:59,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:02:59,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:59,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:03:10,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:10,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:03:10,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-01-31 17:03:10,358 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:03:10,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-31 17:03:10,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-31 17:03:10,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-31 17:03:10,361 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-01-31 17:03:10,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:03:10,584 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-01-31 17:03:10,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-31 17:03:10,584 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-01-31 17:03:10,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:03:10,585 INFO L225 Difference]: With dead ends: 105 [2019-01-31 17:03:10,585 INFO L226 Difference]: Without dead ends: 103 [2019-01-31 17:03:10,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-31 17:03:10,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-31 17:03:10,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-31 17:03:10,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-31 17:03:10,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-01-31 17:03:10,588 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-01-31 17:03:10,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:03:10,589 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-01-31 17:03:10,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-31 17:03:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-01-31 17:03:10,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-31 17:03:10,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:03:10,589 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-01-31 17:03:10,589 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:03:10,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:03:10,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-01-31 17:03:10,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:03:10,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:10,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:03:10,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:10,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:03:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:03:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:14,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:14,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:03:14,231 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:03:14,231 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:03:14,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:14,231 INFO 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:03:14,240 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:03:14,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:03:14,300 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:03:14,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:03:14,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:03:14,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:14,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:03:25,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:25,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:03:25,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-01-31 17:03:25,125 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:03:25,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-31 17:03:25,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-31 17:03:25,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-31 17:03:25,127 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-01-31 17:03:25,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:03:25,439 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-31 17:03:25,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-31 17:03:25,439 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-01-31 17:03:25,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:03:25,440 INFO L225 Difference]: With dead ends: 106 [2019-01-31 17:03:25,440 INFO L226 Difference]: Without dead ends: 104 [2019-01-31 17:03:25,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-31 17:03:25,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-31 17:03:25,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-31 17:03:25,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-31 17:03:25,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-01-31 17:03:25,445 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-01-31 17:03:25,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:03:25,445 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-01-31 17:03:25,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-31 17:03:25,445 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-01-31 17:03:25,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-31 17:03:25,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:03:25,446 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-01-31 17:03:25,446 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:03:25,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:03:25,446 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-01-31 17:03:25,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:03:25,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:25,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:03:25,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:25,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:03:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:03:29,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:29,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:29,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:03:29,106 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:03:29,106 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:03:29,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:29,106 INFO 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:03:29,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:03:29,115 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:03:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:03:29,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:03:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:29,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:03:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:40,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:03:40,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-01-31 17:03:40,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:03:40,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-31 17:03:40,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-31 17:03:40,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-31 17:03:40,141 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-01-31 17:03:40,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:03:40,319 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-01-31 17:03:40,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-31 17:03:40,320 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-01-31 17:03:40,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:03:40,321 INFO L225 Difference]: With dead ends: 107 [2019-01-31 17:03:40,321 INFO L226 Difference]: Without dead ends: 105 [2019-01-31 17:03:40,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-31 17:03:40,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-31 17:03:40,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-31 17:03:40,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-31 17:03:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-01-31 17:03:40,325 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-01-31 17:03:40,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:03:40,325 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-01-31 17:03:40,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-31 17:03:40,326 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-01-31 17:03:40,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-31 17:03:40,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:03:40,326 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-01-31 17:03:40,327 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:03:40,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:03:40,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-01-31 17:03:40,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:03:40,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:40,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:03:40,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:40,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:03:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:03:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:44,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:44,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:03:44,322 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:03:44,323 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:03:44,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:44,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:03:44,330 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:03:44,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:03:46,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-31 17:03:46,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:03:46,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:03:46,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:46,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:03:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:57,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:03:57,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-01-31 17:03:57,347 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:03:57,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-31 17:03:57,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-31 17:03:57,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-31 17:03:57,351 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-01-31 17:03:57,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:03:57,685 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-01-31 17:03:57,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-31 17:03:57,686 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-01-31 17:03:57,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:03:57,686 INFO L225 Difference]: With dead ends: 108 [2019-01-31 17:03:57,687 INFO L226 Difference]: Without dead ends: 106 [2019-01-31 17:03:57,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-31 17:03:57,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-31 17:03:57,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-01-31 17:03:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-31 17:03:57,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-31 17:03:57,692 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-01-31 17:03:57,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:03:57,692 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-31 17:03:57,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-31 17:03:57,692 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-31 17:03:57,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-31 17:03:57,693 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:03:57,693 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-01-31 17:03:57,693 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:03:57,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:03:57,693 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-01-31 17:03:57,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:03:57,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:57,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:03:57,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:57,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:03:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:01,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:01,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:01,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:04:01,725 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:04:01,725 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:04:01,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:01,725 INFO 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:04:01,733 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:04:01,733 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:04:01,796 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:04:01,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:04:01,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:04:01,826 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:01,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:04:13,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:13,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:04:13,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-01-31 17:04:13,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:04:13,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-31 17:04:13,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-31 17:04:13,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-31 17:04:13,455 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-01-31 17:04:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:04:13,756 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-01-31 17:04:13,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-31 17:04:13,756 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-01-31 17:04:13,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:04:13,757 INFO L225 Difference]: With dead ends: 109 [2019-01-31 17:04:13,757 INFO L226 Difference]: Without dead ends: 107 [2019-01-31 17:04:13,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-31 17:04:13,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-31 17:04:13,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-31 17:04:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-31 17:04:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-01-31 17:04:13,761 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-01-31 17:04:13,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:04:13,761 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-01-31 17:04:13,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-31 17:04:13,761 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-01-31 17:04:13,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-31 17:04:13,762 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:04:13,762 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-01-31 17:04:13,762 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:04:13,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:04:13,763 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-01-31 17:04:13,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:04:13,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:13,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:04:13,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:13,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:04:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:18,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:18,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:04:18,102 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:04:18,102 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:04:18,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:18,103 INFO 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:04:18,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:04:18,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:04:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:18,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:04:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:18,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:04:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:29,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:04:29,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-01-31 17:04:29,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:04:29,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-31 17:04:29,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-31 17:04:29,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-31 17:04:29,787 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-01-31 17:04:30,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:04:30,027 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-31 17:04:30,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-01-31 17:04:30,027 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-01-31 17:04:30,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:04:30,027 INFO L225 Difference]: With dead ends: 110 [2019-01-31 17:04:30,028 INFO L226 Difference]: Without dead ends: 108 [2019-01-31 17:04:30,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-31 17:04:30,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-31 17:04:30,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-31 17:04:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-31 17:04:30,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-01-31 17:04:30,032 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-01-31 17:04:30,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:04:30,032 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-01-31 17:04:30,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-31 17:04:30,033 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-01-31 17:04:30,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-31 17:04:30,033 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:04:30,033 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-01-31 17:04:30,033 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:04:30,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:04:30,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-01-31 17:04:30,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:04:30,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:30,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:04:30,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:30,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:04:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:34,121 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:34,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:34,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:04:34,121 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:04:34,121 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:04:34,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:34,122 INFO 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:04:34,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:04:34,129 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:04:36,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-01-31 17:04:36,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:04:36,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:04:36,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:36,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:04:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:48,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:04:48,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-01-31 17:04:48,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:04:48,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-31 17:04:48,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-31 17:04:48,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-31 17:04:48,165 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-01-31 17:04:48,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:04:48,400 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-01-31 17:04:48,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-31 17:04:48,400 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-01-31 17:04:48,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:04:48,400 INFO L225 Difference]: With dead ends: 111 [2019-01-31 17:04:48,400 INFO L226 Difference]: Without dead ends: 109 [2019-01-31 17:04:48,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-31 17:04:48,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-31 17:04:48,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-31 17:04:48,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-31 17:04:48,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-01-31 17:04:48,404 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-01-31 17:04:48,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:04:48,405 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-01-31 17:04:48,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-31 17:04:48,405 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-01-31 17:04:48,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-31 17:04:48,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:04:48,405 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-01-31 17:04:48,405 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:04:48,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:04:48,406 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-01-31 17:04:48,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:04:48,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:48,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:04:48,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:48,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:04:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:52,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:52,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:52,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:04:52,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:04:52,632 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:04:52,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:52,632 INFO 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:04:52,640 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:04:52,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:04:52,705 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:04:52,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:04:52,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:04:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:52,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:05:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:04,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:05:04,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2019-01-31 17:05:04,624 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:05:04,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-31 17:05:04,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-31 17:05:04,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-31 17:05:04,627 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-01-31 17:05:04,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:05:04,874 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-01-31 17:05:04,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-01-31 17:05:04,875 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-01-31 17:05:04,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:05:04,875 INFO L225 Difference]: With dead ends: 112 [2019-01-31 17:05:04,875 INFO L226 Difference]: Without dead ends: 110 [2019-01-31 17:05:04,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-31 17:05:04,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-31 17:05:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-31 17:05:04,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-31 17:05:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-01-31 17:05:04,879 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-01-31 17:05:04,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:05:04,879 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-01-31 17:05:04,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-31 17:05:04,879 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-01-31 17:05:04,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-31 17:05:04,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:05:04,880 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-01-31 17:05:04,880 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:05:04,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:04,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-01-31 17:05:04,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:05:04,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:04,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:05:04,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:04,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:05:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:09,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:09,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:09,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:05:09,234 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:05:09,234 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:05:09,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:09,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:05:09,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:05:09,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:05:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:09,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:05:09,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:09,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:05:21,433 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:21,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:05:21,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2019-01-31 17:05:21,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:05:21,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-01-31 17:05:21,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-01-31 17:05:21,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-31 17:05:21,455 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-01-31 17:05:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:05:21,719 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-01-31 17:05:21,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-01-31 17:05:21,720 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-01-31 17:05:21,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:05:21,720 INFO L225 Difference]: With dead ends: 113 [2019-01-31 17:05:21,720 INFO L226 Difference]: Without dead ends: 111 [2019-01-31 17:05:21,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-31 17:05:21,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-31 17:05:21,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-31 17:05:21,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-31 17:05:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-01-31 17:05:21,724 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-01-31 17:05:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:05:21,724 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-01-31 17:05:21,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-01-31 17:05:21,725 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-01-31 17:05:21,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-31 17:05:21,725 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:05:21,725 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-01-31 17:05:21,725 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:05:21,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:21,725 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-01-31 17:05:21,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:05:21,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:21,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:05:21,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:21,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:05:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:25,910 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:25,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:25,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:05:25,910 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:05:25,911 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:05:25,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:25,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:05:25,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:05:25,919 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:05:28,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-01-31 17:05:28,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:05:28,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:05:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:28,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:05:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:40,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:05:40,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2019-01-31 17:05:40,725 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:05:40,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-31 17:05:40,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-31 17:05:40,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-31 17:05:40,729 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-01-31 17:05:41,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:05:41,059 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-01-31 17:05:41,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-01-31 17:05:41,059 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-01-31 17:05:41,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:05:41,059 INFO L225 Difference]: With dead ends: 114 [2019-01-31 17:05:41,059 INFO L226 Difference]: Without dead ends: 112 [2019-01-31 17:05:41,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-31 17:05:41,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-31 17:05:41,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-31 17:05:41,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-31 17:05:41,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-31 17:05:41,063 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-01-31 17:05:41,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:05:41,064 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-31 17:05:41,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-31 17:05:41,064 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-31 17:05:41,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-31 17:05:41,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:05:41,064 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-01-31 17:05:41,065 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:05:41,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:41,065 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-01-31 17:05:41,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:05:41,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:41,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:05:41,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:41,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:05:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:45,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:45,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:05:45,450 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:05:45,450 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:05:45,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:45,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:05:45,461 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:05:45,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:05:45,527 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:05:45,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:05:45,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:05:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:45,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:05:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:58,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:05:58,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2019-01-31 17:05:58,252 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:05:58,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-31 17:05:58,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-31 17:05:58,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-31 17:05:58,255 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-01-31 17:05:58,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:05:58,508 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-31 17:05:58,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-31 17:05:58,509 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-01-31 17:05:58,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:05:58,510 INFO L225 Difference]: With dead ends: 115 [2019-01-31 17:05:58,510 INFO L226 Difference]: Without dead ends: 113 [2019-01-31 17:05:58,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-31 17:05:58,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-31 17:05:58,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-31 17:05:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-31 17:05:58,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-01-31 17:05:58,514 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-01-31 17:05:58,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:05:58,515 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-01-31 17:05:58,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-31 17:05:58,515 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-01-31 17:05:58,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-31 17:05:58,515 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:05:58,516 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-01-31 17:05:58,516 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:05:58,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:58,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-01-31 17:05:58,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:05:58,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:58,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:05:58,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:58,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:05:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:03,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:03,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:03,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:03,005 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:03,005 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:06:03,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:03,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:03,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:03,015 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:03,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:03,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:03,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:16,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:16,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:16,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2019-01-31 17:06:16,415 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:16,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-31 17:06:16,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-31 17:06:16,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-31 17:06:16,417 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-01-31 17:06:16,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:16,646 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-01-31 17:06:16,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-01-31 17:06:16,646 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-01-31 17:06:16,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:16,647 INFO L225 Difference]: With dead ends: 116 [2019-01-31 17:06:16,647 INFO L226 Difference]: Without dead ends: 114 [2019-01-31 17:06:16,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-31 17:06:16,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-31 17:06:16,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-31 17:06:16,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-31 17:06:16,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-01-31 17:06:16,651 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-01-31 17:06:16,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:16,651 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-01-31 17:06:16,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-31 17:06:16,651 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-01-31 17:06:16,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-31 17:06:16,652 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:16,652 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-01-31 17:06:16,652 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:16,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:16,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-01-31 17:06:16,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:16,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:16,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:16,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:16,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:21,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:21,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:21,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:21,318 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:21,318 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:06:21,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:21,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:21,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:06:21,326 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:06:23,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-01-31 17:06:23,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:06:23,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:23,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:37,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:37,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:37,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2019-01-31 17:06:37,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:37,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-31 17:06:37,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-31 17:06:37,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-01-31 17:06:37,597 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-01-31 17:06:37,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:37,980 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-01-31 17:06:37,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-01-31 17:06:37,980 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-01-31 17:06:37,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:37,981 INFO L225 Difference]: With dead ends: 117 [2019-01-31 17:06:37,981 INFO L226 Difference]: Without dead ends: 115 [2019-01-31 17:06:37,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-01-31 17:06:37,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-31 17:06:37,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-01-31 17:06:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-31 17:06:37,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-01-31 17:06:37,986 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-01-31 17:06:37,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:37,986 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-01-31 17:06:37,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-31 17:06:37,987 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-01-31 17:06:37,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-31 17:06:37,987 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:37,987 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-01-31 17:06:37,987 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:37,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:37,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1736874868, now seen corresponding path program 111 times [2019-01-31 17:06:37,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:37,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:37,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:06:37,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:37,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:42,693 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:42,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:42,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:42,693 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:42,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:06:42,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:42,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 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:42,701 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:06:42,701 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:06:42,773 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:06:42,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:06:42,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:42,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:42,806 INFO L316 TraceCheckSpWp]: Computing backward predicates...